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