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