TSTP Solution File: LCL262-3 by Gandalf---c-2.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Gandalf---c-2.6
% Problem : LCL262-3 : TPTP v3.4.2. Released v2.3.0.
% Transfm : add_equality:r
% Format : otter:hypothesis:set(auto),clear(print_given)
% Command : gandalf-wrapper -time %d %s
% Computer : art10.cs.miami.edu
% Model : i686 unknown
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 1000MB
% OS : Linux 2.4.22-21mdk-i686-up-4GB
% CPULimit : 600s
% Result : Unsatisfiable 110.0s
% Output : Assurance 110.0s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
%
% Gandalf c-2.6 r1 starting to prove: /home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/LCL/LCL262-3+eq_r.in
% Using automatic strategy selection.
% Time limit in seconds: 600
%
% prove-all-passes started
%
% detected problem class: heq
% detected subclass: medium
% detected subclass: short
%
% strategies selected:
% (binary-posweight-order 57 #f 4 5)
% (binary-unit 28 #f 4 5)
% (binary-double 28 #f 4 5)
% (binary 45 #t 4 5)
% (hyper 11 #t 4 5)
% (hyper 28 #f)
% (binary-unit-uniteq 16 #f)
% (binary-weightorder 22 #f)
% (binary-posweight-order 159 #f)
% (binary-posweight-lex-big-order 57 #f)
% (binary-posweight-lex-small-order 11 #f)
% (binary-order 28 #f)
% (binary-unit 45 #f)
% (binary 65 #t)
%
%
% ********* EMPTY CLAUSE DERIVED *********
%
%
% timer checkpoints: c(12,40,0,24,0,0,15790,3,2851,18803,4,4276,21799,5,5701,21799,5,5701,21799,1,5701,21799,50,5703,21799,40,5703,21811,0,5703,30979,3,7112,33153,4,7807,35324,5,8504,35325,5,8504,35325,1,8504,35325,50,8506,35325,40,8506,35337,0,8506,103537,3,9907,124422,4,10607)
%
%
% START OF PROOF
% 10952 [?] ?
% 26196 [?] ?
% 35327 [] axiom(implies(or(X,X),X)).
% 35328 [] axiom(implies(X,or(Y,X))).
% 35329 [] axiom(implies(or(X,Y),or(Y,X))).
% 35330 [] axiom(implies(or(X,or(Y,Z)),or(Y,or(X,Z)))).
% 35332 [] equal(implies(X,Y),or(not(X),Y)).
% 35333 [] -axiom(X) | theorem(X).
% 35334 [] -theorem(implies(X,Y)) | -theorem(X) | theorem(Y).
% 35335 [] equal(and(X,Y),not(implies(X,not(Y)))).
% 35336 [] equal(equivalent(X,Y),and(implies(X,Y),implies(Y,X))).
% 35337 [] -theorem(equivalent(implies(p,q),implies(not(q),not(p)))).
% 35339 [binary:35333,35327] theorem(implies(or(X,X),X)).
% 35340 [binary:35333,35328] theorem(implies(X,or(Y,X))).
% 35348 [para:35332.1.2,35329.1.1.2] axiom(implies(or(X,not(Y)),implies(Y,X))).
% 35350 [para:35332.1.2,35330.1.1.1,demod:35332] axiom(implies(implies(X,or(Y,Z)),or(Y,implies(X,Z)))).
% 35353 [binary:35333.2,35334] -axiom(implies(X,Y)) | -theorem(X) | theorem(Y).
% 35355 [binary:35339,35334] -theorem(or(X,X)) | theorem(X).
% 35421 [para:35335.1.2,35332.1.2.1] equal(implies(implies(X,not(Y)),Z),or(and(X,Y),Z)).
% 35504 [binary:35340,35353.2] -axiom(implies(implies(X,or(Y,X)),Z)) | theorem(Z).
% 35527 [binary:35353,35348] -theorem(or(X,not(Y))) | theorem(implies(Y,X)).
% 39459 [binary:35334,35527.2] -theorem(or(X,not(Y))) | -theorem(Y) | theorem(X).
% 41048 [binary:35350,35504] theorem(or(X,implies(Y,Y))).
% 41186 [binary:35355,41048] theorem(implies(X,X)).
% 41215 [binary:35353.2,41186] -axiom(implies(implies(X,X),Y)) | theorem(Y).
% 44436 [binary:35350,41215] theorem(or(X,implies(or(X,Y),Y))).
% 45826 [para:35332.1.2,44436.1.1,demod:35332] theorem(implies(X,implies(implies(X,Y),Y))).
% 46055 [binary:35334,45826] theorem(implies(implies(X,Y),Y)) | -theorem(X).
% 46125 [para:35421.1.1,46055.1.1] theorem(or(and(X,Y),not(Y))) | -theorem(X).
% 67677 [binary:39459,46125] theorem(and(X,Y)) | -theorem(Y) | -theorem(X).
% 68010 [para:35336.1.2,67677.1.1] -theorem(implies(X,Y)) | -theorem(implies(Y,X)) | theorem(equivalent(Y,X)).
% 132059 [binary:35337,68010.3,demod:35421,cut:10952,cut:26196] contradiction
% END OF PROOF
%
% Proof found by the following strategy:
%
% using binary resolution
% not using sos strategy
% using unit paramodulation strategy
% using unit strategy
% using double strategy
% using dynamic demodulation
% using ordered paramodulation
% using kb ordering for equality
% preferring bigger arities for lex ordering
% using clause demodulation
% clause length limited to 5
% clause depth limited to 4
% seconds given: 28
%
%
% old unit clauses discarded
%
% ***GANDALF_FOUND_A_REFUTATION***
%
% Global statistics over all passes:
%
% given clauses: 13976
% derived clauses: 2463183
% kept clauses: 104125
% kept size sum: 0
% kept mid-nuclei: 12804
% kept new demods: 18
% forw unit-subs: 272567
% forw double-subs: 138039
% forw overdouble-subs: 11852
% backward subs: 240
% fast unit cutoff: 67
% full unit cutoff: 39
% dbl unit cutoff: 0
% real runtime : 110.21
% process. runtime: 110.14
% specific non-discr-tree subsumption statistics:
% tried: 397557
% length fails: 9062
% strength fails: 997
% predlist fails: 180619
% aux str. fails: 352
% by-lit fails: 1136
% full subs tried: 196829
% full subs fail: 184977
%
% ; program args: ("/home/graph/tptp/Systems/Gandalf---c-2.6/gandalf" "-time" "600" "/home/graph/tptp/TSTP/PreparedTPTP/otter:hypothesis:set(auto),clear(print_given)---add_equality:r/LCL/LCL262-3+eq_r.in")
%
%------------------------------------------------------------------------------