TSTP Solution File: GRP570-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP570-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n021.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 12:57:16 EDT 2022
% Result : Unsatisfiable 1.76s 1.92s
% Output : Refutation 1.76s
% 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; 2 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; 2 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
multiply(identity,a2) != a2,
file('GRP570-1.p',unknown),
[] ).
cnf(3,axiom,
double_divide(double_divide(A,double_divide(double_divide(B,double_divide(A,C)),double_divide(C,identity))),double_divide(identity,identity)) = B,
file('GRP570-1.p',unknown),
[] ).
cnf(6,axiom,
multiply(A,B) = double_divide(double_divide(B,A),identity),
file('GRP570-1.p',unknown),
[] ).
cnf(8,axiom,
inverse(A) = double_divide(A,identity),
file('GRP570-1.p',unknown),
[] ).
cnf(9,axiom,
identity = double_divide(A,inverse(A)),
file('GRP570-1.p',unknown),
[] ).
cnf(11,plain,
double_divide(A,double_divide(A,identity)) = identity,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(copy,[status(thm)],[9]),8])]),
[iquote('copy,9,demod,8,flip.1')] ).
cnf(12,plain,
double_divide(double_divide(a2,identity),identity) != a2,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1]),6]),
[iquote('back_demod,1,demod,6')] ).
cnf(18,plain,
double_divide(double_divide(A,identity),double_divide(identity,identity)) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[3,11]),11]),
[iquote('para_into,3.1.1.1.2.1,10.1.1,demod,11')] ).
cnf(21,plain,
double_divide(double_divide(identity,double_divide(A,double_divide(identity,identity))),double_divide(identity,identity)) = double_divide(A,identity),
inference(para_from,[status(thm),theory(equality)],[18,3]),
[iquote('para_from,17.1.1,3.1.1.1.2.1')] ).
cnf(31,plain,
double_divide(identity,identity) = identity,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[21,11]),18])]),
[iquote('para_into,21.1.1.1.2,10.1.1,demod,18,flip.1')] ).
cnf(38,plain,
double_divide(double_divide(A,identity),identity) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[18]),31]),
[iquote('back_demod,17,demod,31')] ).
cnf(40,plain,
$false,
inference(binary,[status(thm)],[38,12]),
[iquote('binary,38.1,12.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP570-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jul 27 05:11:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.76/1.92 ----- Otter 3.3f, August 2004 -----
% 1.76/1.92 The process was started by sandbox on n021.cluster.edu,
% 1.76/1.92 Wed Jul 27 05:11:38 2022
% 1.76/1.92 The command was "./otter". The process ID is 1235.
% 1.76/1.92
% 1.76/1.92 set(prolog_style_variables).
% 1.76/1.92 set(auto).
% 1.76/1.92 dependent: set(auto1).
% 1.76/1.92 dependent: set(process_input).
% 1.76/1.92 dependent: clear(print_kept).
% 1.76/1.92 dependent: clear(print_new_demod).
% 1.76/1.92 dependent: clear(print_back_demod).
% 1.76/1.92 dependent: clear(print_back_sub).
% 1.76/1.92 dependent: set(control_memory).
% 1.76/1.92 dependent: assign(max_mem, 12000).
% 1.76/1.92 dependent: assign(pick_given_ratio, 4).
% 1.76/1.92 dependent: assign(stats_level, 1).
% 1.76/1.92 dependent: assign(max_seconds, 10800).
% 1.76/1.92 clear(print_given).
% 1.76/1.92
% 1.76/1.92 list(usable).
% 1.76/1.92 0 [] A=A.
% 1.76/1.92 0 [] double_divide(double_divide(A,double_divide(double_divide(B,double_divide(A,C)),double_divide(C,identity))),double_divide(identity,identity))=B.
% 1.76/1.92 0 [] multiply(A,B)=double_divide(double_divide(B,A),identity).
% 1.76/1.92 0 [] inverse(A)=double_divide(A,identity).
% 1.76/1.92 0 [] identity=double_divide(A,inverse(A)).
% 1.76/1.92 0 [] multiply(identity,a2)!=a2.
% 1.76/1.92 end_of_list.
% 1.76/1.92
% 1.76/1.92 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.76/1.92
% 1.76/1.92 All clauses are units, and equality is present; the
% 1.76/1.92 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.76/1.92
% 1.76/1.92 dependent: set(knuth_bendix).
% 1.76/1.92 dependent: set(anl_eq).
% 1.76/1.92 dependent: set(para_from).
% 1.76/1.92 dependent: set(para_into).
% 1.76/1.92 dependent: clear(para_from_right).
% 1.76/1.92 dependent: clear(para_into_right).
% 1.76/1.92 dependent: set(para_from_vars).
% 1.76/1.92 dependent: set(eq_units_both_ways).
% 1.76/1.92 dependent: set(dynamic_demod_all).
% 1.76/1.92 dependent: set(dynamic_demod).
% 1.76/1.92 dependent: set(order_eq).
% 1.76/1.92 dependent: set(back_demod).
% 1.76/1.92 dependent: set(lrpo).
% 1.76/1.92
% 1.76/1.92 ------------> process usable:
% 1.76/1.92 ** KEPT (pick-wt=5): 1 [] multiply(identity,a2)!=a2.
% 1.76/1.92
% 1.76/1.92 ------------> process sos:
% 1.76/1.92 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.76/1.92 ** KEPT (pick-wt=17): 3 [] double_divide(double_divide(A,double_divide(double_divide(B,double_divide(A,C)),double_divide(C,identity))),double_divide(identity,identity))=B.
% 1.76/1.92 ---> New Demodulator: 4 [new_demod,3] double_divide(double_divide(A,double_divide(double_divide(B,double_divide(A,C)),double_divide(C,identity))),double_divide(identity,identity))=B.
% 1.76/1.92 ** KEPT (pick-wt=9): 5 [] multiply(A,B)=double_divide(double_divide(B,A),identity).
% 1.76/1.92 ---> New Demodulator: 6 [new_demod,5] multiply(A,B)=double_divide(double_divide(B,A),identity).
% 1.76/1.92 ** KEPT (pick-wt=6): 7 [] inverse(A)=double_divide(A,identity).
% 1.76/1.92 ---> New Demodulator: 8 [new_demod,7] inverse(A)=double_divide(A,identity).
% 1.76/1.92 ** KEPT (pick-wt=7): 10 [copy,9,demod,8,flip.1] double_divide(A,double_divide(A,identity))=identity.
% 1.76/1.92 ---> New Demodulator: 11 [new_demod,10] double_divide(A,double_divide(A,identity))=identity.
% 1.76/1.92 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.76/1.92 >>>> Starting back demodulation with 4.
% 1.76/1.92 >>>> Starting back demodulation with 6.
% 1.76/1.92 >> back demodulating 1 with 6.
% 1.76/1.92 >>>> Starting back demodulation with 8.
% 1.76/1.92 >>>> Starting back demodulation with 11.
% 1.76/1.92
% 1.76/1.92 ======= end of input processing =======
% 1.76/1.92
% 1.76/1.92 =========== start of search ===========
% 1.76/1.92
% 1.76/1.92 -------- PROOF --------
% 1.76/1.92
% 1.76/1.92 ----> UNIT CONFLICT at 0.00 sec ----> 40 [binary,38.1,12.1] $F.
% 1.76/1.92
% 1.76/1.92 Length of proof is 6. Level of proof is 5.
% 1.76/1.92
% 1.76/1.92 ---------------- PROOF ----------------
% 1.76/1.92 % SZS status Unsatisfiable
% 1.76/1.92 % SZS output start Refutation
% See solution above
% 1.76/1.92 ------------ end of proof -------------
% 1.76/1.92
% 1.76/1.92
% 1.76/1.92 Search stopped by max_proofs option.
% 1.76/1.92
% 1.76/1.92
% 1.76/1.92 Search stopped by max_proofs option.
% 1.76/1.92
% 1.76/1.92 ============ end of search ============
% 1.76/1.92
% 1.76/1.92 -------------- statistics -------------
% 1.76/1.92 clauses given 8
% 1.76/1.92 clauses generated 22
% 1.76/1.92 clauses kept 23
% 1.76/1.92 clauses forward subsumed 19
% 1.76/1.92 clauses back subsumed 0
% 1.76/1.92 Kbytes malloced 976
% 1.76/1.92
% 1.76/1.92 ----------- times (seconds) -----------
% 1.76/1.92 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.76/1.92 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.76/1.92 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.76/1.92
% 1.76/1.92 That finishes the proof of the theorem.
% 1.76/1.92
% 1.76/1.92 Process 1235 finished Wed Jul 27 05:11:39 2022
% 1.76/1.92 Otter interrupted
% 1.76/1.92 PROOF FOUND
%------------------------------------------------------------------------------