TSTP Solution File: LCL083-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL083-2 : TPTP v8.1.0. Bugfixed v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n005.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:29 EDT 2022
% Result : Unsatisfiable 1.65s 1.89s
% Output : Refutation 1.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of clauses : 17 ( 16 unt; 0 nHn; 3 RR)
% Number of literals : 19 ( 0 equ; 3 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 45 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(implies(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL083-2.p',unknown),
[] ).
cnf(2,axiom,
~ is_a_theorem(implies(implies(implies(a,b),a),a)),
file('LCL083-2.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(implies(implies(implies(A,B),C),implies(implies(C,A),implies(D,A)))),
file('LCL083-2.p',unknown),
[] ).
cnf(4,axiom,
is_a_theorem(implies(A,A)),
file('LCL083-2.p',unknown),
[] ).
cnf(6,plain,
is_a_theorem(implies(implies(implies(A,B),A),implies(C,A))),
inference(hyper,[status(thm)],[4,1,3]),
[iquote('hyper,4,1,3')] ).
cnf(7,plain,
is_a_theorem(implies(A,implies(B,B))),
inference(hyper,[status(thm)],[6,1,6]),
[iquote('hyper,6,1,6')] ).
cnf(8,plain,
is_a_theorem(implies(implies(implies(A,B),implies(B,C)),implies(D,implies(B,C)))),
inference(hyper,[status(thm)],[6,1,3]),
[iquote('hyper,6,1,3')] ).
cnf(9,plain,
is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))),
inference(hyper,[status(thm)],[7,1,3]),
[iquote('hyper,7,1,3')] ).
cnf(28,plain,
is_a_theorem(implies(implies(implies(A,implies(B,C)),implies(D,B)),implies(E,implies(D,B)))),
inference(hyper,[status(thm)],[8,1,3]),
[iquote('hyper,8,1,3')] ).
cnf(104,plain,
is_a_theorem(implies(A,implies(implies(implies(implies(B,C),D),C),implies(B,C)))),
inference(hyper,[status(thm)],[28,1,3]),
[iquote('hyper,28,1,3')] ).
cnf(105,plain,
is_a_theorem(implies(implies(implies(implies(A,B),C),B),implies(A,B))),
inference(hyper,[status(thm)],[104,1,104]),
[iquote('hyper,104,1,104')] ).
cnf(109,plain,
is_a_theorem(implies(implies(implies(A,B),implies(implies(A,B),C)),implies(D,implies(implies(A,B),C)))),
inference(hyper,[status(thm)],[105,1,3]),
[iquote('hyper,105,1,3')] ).
cnf(827,plain,
is_a_theorem(implies(A,implies(implies(implies(B,B),C),C))),
inference(hyper,[status(thm)],[109,1,9]),
[iquote('hyper,109,1,9')] ).
cnf(829,plain,
is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))),
inference(hyper,[status(thm)],[109,1,6]),
[iquote('hyper,109,1,6')] ).
cnf(831,plain,
is_a_theorem(implies(implies(implies(A,A),B),B)),
inference(hyper,[status(thm)],[827,1,827]),
[iquote('hyper,827,1,827')] ).
cnf(856,plain,
is_a_theorem(implies(implies(implies(A,B),A),A)),
inference(hyper,[status(thm)],[829,1,831]),
[iquote('hyper,829,1,831')] ).
cnf(857,plain,
$false,
inference(binary,[status(thm)],[856,2]),
[iquote('binary,856.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL083-2 : TPTP v8.1.0. Bugfixed v1.2.0.
% 0.03/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n005.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:29:35 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.65/1.89 ----- Otter 3.3f, August 2004 -----
% 1.65/1.89 The process was started by sandbox2 on n005.cluster.edu,
% 1.65/1.89 Wed Jul 27 09:29:35 2022
% 1.65/1.89 The command was "./otter". The process ID is 779.
% 1.65/1.89
% 1.65/1.89 set(prolog_style_variables).
% 1.65/1.89 set(auto).
% 1.65/1.89 dependent: set(auto1).
% 1.65/1.89 dependent: set(process_input).
% 1.65/1.89 dependent: clear(print_kept).
% 1.65/1.89 dependent: clear(print_new_demod).
% 1.65/1.89 dependent: clear(print_back_demod).
% 1.65/1.89 dependent: clear(print_back_sub).
% 1.65/1.89 dependent: set(control_memory).
% 1.65/1.89 dependent: assign(max_mem, 12000).
% 1.65/1.89 dependent: assign(pick_given_ratio, 4).
% 1.65/1.89 dependent: assign(stats_level, 1).
% 1.65/1.89 dependent: assign(max_seconds, 10800).
% 1.65/1.89 clear(print_given).
% 1.65/1.89
% 1.65/1.89 list(usable).
% 1.65/1.89 0 [] -is_a_theorem(implies(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 1.65/1.89 0 [] is_a_theorem(implies(implies(implies(X,Y),Z),implies(implies(Z,X),implies(U,X)))).
% 1.65/1.89 0 [] is_a_theorem(implies(X,X)).
% 1.65/1.89 0 [] -is_a_theorem(implies(implies(implies(a,b),a),a)).
% 1.65/1.89 end_of_list.
% 1.65/1.89
% 1.65/1.89 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.65/1.89
% 1.65/1.89 This is a Horn set without equality. The strategy will
% 1.65/1.89 be hyperresolution, with satellites in sos and nuclei
% 1.65/1.89 in usable.
% 1.65/1.89
% 1.65/1.89 dependent: set(hyper_res).
% 1.65/1.89 dependent: clear(order_hyper).
% 1.65/1.89
% 1.65/1.89 ------------> process usable:
% 1.65/1.89 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 1.65/1.89 ** KEPT (pick-wt=8): 2 [] -is_a_theorem(implies(implies(implies(a,b),a),a)).
% 1.65/1.89
% 1.65/1.89 ------------> process sos:
% 1.65/1.89 ** KEPT (pick-wt=14): 3 [] is_a_theorem(implies(implies(implies(A,B),C),implies(implies(C,A),implies(D,A)))).
% 1.65/1.89 ** KEPT (pick-wt=4): 4 [] is_a_theorem(implies(A,A)).
% 1.65/1.89
% 1.65/1.89 ======= end of input processing =======
% 1.65/1.89
% 1.65/1.89 =========== start of search ===========
% 1.65/1.89
% 1.65/1.89 -------- PROOF --------
% 1.65/1.89
% 1.65/1.89 ----> UNIT CONFLICT at 0.04 sec ----> 857 [binary,856.1,2.1] $F.
% 1.65/1.89
% 1.65/1.89 Length of proof is 12. Level of proof is 9.
% 1.65/1.89
% 1.65/1.89 ---------------- PROOF ----------------
% 1.65/1.89 % SZS status Unsatisfiable
% 1.65/1.89 % SZS output start Refutation
% See solution above
% 1.65/1.89 ------------ end of proof -------------
% 1.65/1.89
% 1.65/1.89
% 1.65/1.89 Search stopped by max_proofs option.
% 1.65/1.89
% 1.65/1.89
% 1.65/1.89 Search stopped by max_proofs option.
% 1.65/1.89
% 1.65/1.89 ============ end of search ============
% 1.65/1.89
% 1.65/1.89 -------------- statistics -------------
% 1.65/1.89 clauses given 113
% 1.65/1.89 clauses generated 10971
% 1.65/1.89 clauses kept 856
% 1.65/1.89 clauses forward subsumed 10119
% 1.65/1.89 clauses back subsumed 196
% 1.65/1.89 Kbytes malloced 1953
% 1.65/1.89
% 1.65/1.89 ----------- times (seconds) -----------
% 1.65/1.89 user CPU time 0.04 (0 hr, 0 min, 0 sec)
% 1.65/1.89 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.65/1.89 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.65/1.89
% 1.65/1.89 That finishes the proof of the theorem.
% 1.65/1.89
% 1.65/1.89 Process 779 finished Wed Jul 27 09:29:37 2022
% 1.65/1.89 Otter interrupted
% 1.65/1.89 PROOF FOUND
%------------------------------------------------------------------------------