TSTP Solution File: SYN957+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN957+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n027.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:25:34 EDT 2022
% Result : Theorem 1.64s 1.87s
% Output : Refutation 1.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 2
% Syntax : Number of clauses : 5 ( 3 unt; 1 nHn; 4 RR)
% Number of literals : 7 ( 0 equ; 3 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 2 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ a(A,dollar_c1)
| ~ a(A,A) ),
file('SYN957+1.p',unknown),
[] ).
cnf(2,plain,
~ a(dollar_c1,dollar_c1),
inference(factor,[status(thm)],[1]),
[iquote('factor,1.1.2')] ).
cnf(3,axiom,
( a(A,dollar_c1)
| a(A,A) ),
file('SYN957+1.p',unknown),
[] ).
cnf(4,plain,
a(dollar_c1,dollar_c1),
inference(factor,[status(thm)],[3]),
[iquote('factor,3.1.2')] ).
cnf(5,plain,
$false,
inference(binary,[status(thm)],[4,2]),
[iquote('binary,4.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SYN957+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n027.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 11:24:22 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.64/1.87
% 1.64/1.87 -------- PROOF --------
% 1.64/1.87 ----- Otter 3.3f, August 2004 -----
% 1.64/1.87 The process was started by sandbox2 on n027.cluster.edu,
% 1.64/1.87 Wed Jul 27 11:24:22 2022
% 1.64/1.87 The command was "./otter". The process ID is 4536.
% 1.64/1.87
% 1.64/1.87 set(prolog_style_variables).
% 1.64/1.87 set(auto).
% 1.64/1.87 dependent: set(auto1).
% 1.64/1.87 dependent: set(process_input).
% 1.64/1.87 dependent: clear(print_kept).
% 1.64/1.87 dependent: clear(print_new_demod).
% 1.64/1.87 dependent: clear(print_back_demod).
% 1.64/1.87 dependent: clear(print_back_sub).
% 1.64/1.87 dependent: set(control_memory).
% 1.64/1.87 dependent: assign(max_mem, 12000).
% 1.64/1.87 dependent: assign(pick_given_ratio, 4).
% 1.64/1.87 dependent: assign(stats_level, 1).
% 1.64/1.87 dependent: assign(max_seconds, 10800).
% 1.64/1.87 clear(print_given).
% 1.64/1.87
% 1.64/1.87 formula_list(usable).
% 1.64/1.87 -(-(exists Y all X (a(X,Y)<-> -a(X,X)))).
% 1.64/1.87 end_of_list.
% 1.64/1.87
% 1.64/1.87 -------> usable clausifies to:
% 1.64/1.87
% 1.64/1.87 list(usable).
% 1.64/1.87 0 [] -a(X,$c1)| -a(X,X).
% 1.64/1.87 0 [] a(X,$c1)|a(X,X).
% 1.64/1.87 end_of_list.
% 1.64/1.87
% 1.64/1.87 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=2.
% 1.64/1.87
% 1.64/1.87 This is a non-Horn set without equality. The strategy will
% 1.64/1.87 be ordered hyper_res, unit deletion, and factoring, with
% 1.64/1.87 satellites in sos and with nuclei in usable.
% 1.64/1.87
% 1.64/1.87 dependent: set(hyper_res).
% 1.64/1.87 dependent: set(factor).
% 1.64/1.87 dependent: set(unit_deletion).
% 1.64/1.87
% 1.64/1.87 ------------> process usable:
% 1.64/1.87 ** KEPT (pick-wt=6): 1 [] -a(A,$c1)| -a(A,A).
% 1.64/1.87
% 1.64/1.87 ------------> process sos:
% 1.64/1.87 ** KEPT (pick-wt=6): 3 [] a(A,$c1)|a(A,A).
% 1.64/1.87
% 1.64/1.87 ----> UNIT CONFLICT at 0.00 sec ----> 5 [binary,4.1,2.1] $F.
% 1.64/1.87
% 1.64/1.87 Length of proof is 2. Level of proof is 1.
% 1.64/1.87
% 1.64/1.87 ---------------- PROOF ----------------
% 1.64/1.87 % SZS status Theorem
% 1.64/1.87 % SZS output start Refutation
% See solution above
% 1.64/1.87 ------------ end of proof -------------
% 1.64/1.87
% 1.64/1.87
% 1.64/1.87 Search stopped by max_proofs option.
% 1.64/1.87
% 1.64/1.87
% 1.64/1.87 Search stopped by max_proofs option.
% 1.64/1.87
% 1.64/1.87 ============ end of search ============
% 1.64/1.87
% 1.64/1.87 -------------- statistics -------------
% 1.64/1.87 clauses given 0
% 1.64/1.87 clauses generated 2
% 1.64/1.87 clauses kept 4
% 1.64/1.87 clauses forward subsumed 0
% 1.64/1.87 clauses back subsumed 0
% 1.64/1.87 Kbytes malloced 976
% 1.64/1.87
% 1.64/1.87 ----------- times (seconds) -----------
% 1.64/1.87 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.64/1.87 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.64/1.87 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.64/1.87
% 1.64/1.87 That finishes the proof of the theorem.
% 1.64/1.87
% 1.64/1.87 Process 4536 finished Wed Jul 27 11:24:23 2022
% 1.64/1.87 Otter interrupted
% 1.64/1.87 PROOF FOUND
%------------------------------------------------------------------------------