TSTP Solution File: LCL134-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL134-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Jul 27 13:03:39 EDT 2022
% Result : Unsatisfiable 1.76s 1.94s
% Output : Refutation 1.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 9 ( 9 unt; 0 nHn; 2 RR)
% Number of literals : 9 ( 8 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 11 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
implies(x,truth) != truth,
file('LCL134-1.p',unknown),
[] ).
cnf(4,axiom,
implies(truth,A) = A,
file('LCL134-1.p',unknown),
[] ).
cnf(5,axiom,
implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth,
file('LCL134-1.p',unknown),
[] ).
cnf(7,axiom,
implies(implies(A,B),B) = implies(implies(B,A),A),
file('LCL134-1.p',unknown),
[] ).
cnf(12,plain,
implies(implies(A,truth),truth) = implies(A,A),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[7,4])]),
[iquote('para_into,7.1.1.1,3.1.1,flip.1')] ).
cnf(34,plain,
implies(A,implies(implies(A,B),B)) = truth,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[5,4]),4]),
[iquote('para_into,5.1.1.1,3.1.1,demod,4')] ).
cnf(83,plain,
implies(A,A) = truth,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[34,4]),4]),
[iquote('para_into,34.1.1.2.1,3.1.1,demod,4')] ).
cnf(86,plain,
implies(A,truth) = truth,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[34,12]),83]),
[iquote('para_into,34.1.1.2,12.1.1,demod,83')] ).
cnf(88,plain,
$false,
inference(binary,[status(thm)],[86,1]),
[iquote('binary,86.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL134-1 : TPTP v8.1.0. Released v1.0.0.
% 0.13/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 09:20:31 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.76/1.94 ----- Otter 3.3f, August 2004 -----
% 1.76/1.94 The process was started by sandbox on n018.cluster.edu,
% 1.76/1.94 Wed Jul 27 09:20:31 2022
% 1.76/1.94 The command was "./otter". The process ID is 9247.
% 1.76/1.94
% 1.76/1.94 set(prolog_style_variables).
% 1.76/1.94 set(auto).
% 1.76/1.94 dependent: set(auto1).
% 1.76/1.94 dependent: set(process_input).
% 1.76/1.94 dependent: clear(print_kept).
% 1.76/1.94 dependent: clear(print_new_demod).
% 1.76/1.94 dependent: clear(print_back_demod).
% 1.76/1.94 dependent: clear(print_back_sub).
% 1.76/1.94 dependent: set(control_memory).
% 1.76/1.94 dependent: assign(max_mem, 12000).
% 1.76/1.94 dependent: assign(pick_given_ratio, 4).
% 1.76/1.94 dependent: assign(stats_level, 1).
% 1.76/1.94 dependent: assign(max_seconds, 10800).
% 1.76/1.94 clear(print_given).
% 1.76/1.94
% 1.76/1.94 list(usable).
% 1.76/1.94 0 [] A=A.
% 1.76/1.94 0 [] implies(truth,X)=X.
% 1.76/1.94 0 [] implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z)))=truth.
% 1.76/1.94 0 [] implies(implies(X,Y),Y)=implies(implies(Y,X),X).
% 1.76/1.94 0 [] implies(implies(not(X),not(Y)),implies(Y,X))=truth.
% 1.76/1.94 0 [] implies(x,truth)!=truth.
% 1.76/1.94 end_of_list.
% 1.76/1.94
% 1.76/1.94 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.76/1.94
% 1.76/1.94 All clauses are units, and equality is present; the
% 1.76/1.94 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.76/1.94
% 1.76/1.94 dependent: set(knuth_bendix).
% 1.76/1.94 dependent: set(anl_eq).
% 1.76/1.94 dependent: set(para_from).
% 1.76/1.94 dependent: set(para_into).
% 1.76/1.94 dependent: clear(para_from_right).
% 1.76/1.94 dependent: clear(para_into_right).
% 1.76/1.94 dependent: set(para_from_vars).
% 1.76/1.94 dependent: set(eq_units_both_ways).
% 1.76/1.94 dependent: set(dynamic_demod_all).
% 1.76/1.94 dependent: set(dynamic_demod).
% 1.76/1.94 dependent: set(order_eq).
% 1.76/1.94 dependent: set(back_demod).
% 1.76/1.94 dependent: set(lrpo).
% 1.76/1.94
% 1.76/1.94 ------------> process usable:
% 1.76/1.94 ** KEPT (pick-wt=5): 1 [] implies(x,truth)!=truth.
% 1.76/1.94
% 1.76/1.94 ------------> process sos:
% 1.76/1.94 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.76/1.94 ** KEPT (pick-wt=5): 3 [] implies(truth,A)=A.
% 1.76/1.94 ---> New Demodulator: 4 [new_demod,3] implies(truth,A)=A.
% 1.76/1.94 ** KEPT (pick-wt=13): 5 [] implies(implies(A,B),implies(implies(B,C),implies(A,C)))=truth.
% 1.76/1.94 ---> New Demodulator: 6 [new_demod,5] implies(implies(A,B),implies(implies(B,C),implies(A,C)))=truth.
% 1.76/1.94 ** KEPT (pick-wt=11): 7 [] implies(implies(A,B),B)=implies(implies(B,A),A).
% 1.76/1.94 ** KEPT (pick-wt=11): 8 [] implies(implies(not(A),not(B)),implies(B,A))=truth.
% 1.76/1.94 ---> New Demodulator: 9 [new_demod,8] implies(implies(not(A),not(B)),implies(B,A))=truth.
% 1.76/1.94 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.76/1.94 >>>> Starting back demodulation with 4.
% 1.76/1.94 >>>> Starting back demodulation with 6.
% 1.76/1.94 Following clause subsumed by 7 during input processing: 0 [copy,7,flip.1] implies(implies(A,B),B)=implies(implies(B,A),A).
% 1.76/1.94 >>>> Starting back demodulation with 9.
% 1.76/1.94
% 1.76/1.94 ======= end of input processing =======
% 1.76/1.94
% 1.76/1.94 =========== start of search ===========
% 1.76/1.94
% 1.76/1.94 -------- PROOF --------
% 1.76/1.94
% 1.76/1.94 ----> UNIT CONFLICT at 0.00 sec ----> 88 [binary,86.1,1.1] $F.
% 1.76/1.94
% 1.76/1.94 Length of proof is 4. Level of proof is 3.
% 1.76/1.94
% 1.76/1.94 ---------------- PROOF ----------------
% 1.76/1.94 % SZS status Unsatisfiable
% 1.76/1.94 % SZS output start Refutation
% See solution above
% 1.76/1.94 ------------ end of proof -------------
% 1.76/1.94
% 1.76/1.94
% 1.76/1.94 Search stopped by max_proofs option.
% 1.76/1.94
% 1.76/1.94
% 1.76/1.94 Search stopped by max_proofs option.
% 1.76/1.94
% 1.76/1.94 ============ end of search ============
% 1.76/1.94
% 1.76/1.94 -------------- statistics -------------
% 1.76/1.94 clauses given 8
% 1.76/1.94 clauses generated 69
% 1.76/1.94 clauses kept 46
% 1.76/1.94 clauses forward subsumed 34
% 1.76/1.94 clauses back subsumed 0
% 1.76/1.94 Kbytes malloced 976
% 1.76/1.94
% 1.76/1.94 ----------- times (seconds) -----------
% 1.76/1.94 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.76/1.94 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.76/1.94 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.76/1.94
% 1.76/1.94 That finishes the proof of the theorem.
% 1.76/1.94
% 1.76/1.94 Process 9247 finished Wed Jul 27 09:20:33 2022
% 1.76/1.94 Otter interrupted
% 1.76/1.94 PROOF FOUND
%------------------------------------------------------------------------------