TSTP Solution File: SYN350+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN350+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n007.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:24:20 EDT 2022
% Result : Theorem 1.72s 1.95s
% Output : Refutation 1.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 7 ( 3 unt; 1 nHn; 4 RR)
% Number of literals : 12 ( 0 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 9 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ big_f(dollar_c1,dollar_f1(A,B))
| big_f(dollar_f1(A,B),dollar_c1) ),
file('SYN350+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ big_f(dollar_c1,dollar_f1(A,B))
| ~ big_f(B,dollar_f1(A,B))
| ~ big_f(A,B) ),
file('SYN350+1.p',unknown),
[] ).
cnf(7,plain,
( ~ big_f(dollar_c1,dollar_f1(A,dollar_c1))
| ~ big_f(A,dollar_c1) ),
inference(factor,[status(thm)],[5]),
[iquote('factor,5.1.2')] ).
cnf(8,axiom,
( big_f(dollar_c1,dollar_f1(A,B))
| big_f(B,dollar_f1(A,B)) ),
file('SYN350+1.p',unknown),
[] ).
cnf(9,plain,
big_f(dollar_c1,dollar_f1(A,dollar_c1)),
inference(factor,[status(thm)],[8]),
[iquote('factor,8.1.2')] ).
cnf(13,plain,
big_f(dollar_f1(A,dollar_c1),dollar_c1),
inference(hyper,[status(thm)],[9,1]),
[iquote('hyper,9,1')] ).
cnf(14,plain,
$false,
inference(hyper,[status(thm)],[13,7,9]),
[iquote('hyper,13,7,9')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN350+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n007.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 10:41:31 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.72/1.95 ----- Otter 3.3f, August 2004 -----
% 1.72/1.95 The process was started by sandbox2 on n007.cluster.edu,
% 1.72/1.95 Wed Jul 27 10:41:31 2022
% 1.72/1.95 The command was "./otter". The process ID is 19368.
% 1.72/1.95
% 1.72/1.95 set(prolog_style_variables).
% 1.72/1.95 set(auto).
% 1.72/1.95 dependent: set(auto1).
% 1.72/1.95 dependent: set(process_input).
% 1.72/1.95 dependent: clear(print_kept).
% 1.72/1.95 dependent: clear(print_new_demod).
% 1.72/1.95 dependent: clear(print_back_demod).
% 1.72/1.95 dependent: clear(print_back_sub).
% 1.72/1.95 dependent: set(control_memory).
% 1.72/1.95 dependent: assign(max_mem, 12000).
% 1.72/1.95 dependent: assign(pick_given_ratio, 4).
% 1.72/1.95 dependent: assign(stats_level, 1).
% 1.72/1.95 dependent: assign(max_seconds, 10800).
% 1.72/1.95 clear(print_given).
% 1.72/1.95
% 1.72/1.95 formula_list(usable).
% 1.72/1.95 -(all X exists Y1 Y2 all Z ((big_f(X,Z)<->big_f(Z,X))-> (big_f(X,Z)<->big_f(Y2,Z)& (big_f(Y1,Z)->big_f(Y1,Y2))))).
% 1.72/1.95 end_of_list.
% 1.72/1.95
% 1.72/1.95 -------> usable clausifies to:
% 1.72/1.95
% 1.72/1.95 list(usable).
% 1.72/1.95 0 [] -big_f($c1,$f1(Y1,Y2))|big_f($f1(Y1,Y2),$c1).
% 1.72/1.95 0 [] big_f($c1,$f1(Y1,Y2))| -big_f($f1(Y1,Y2),$c1).
% 1.72/1.95 0 [] big_f($c1,$f1(Y1,Y2))|big_f(Y2,$f1(Y1,Y2)).
% 1.72/1.95 0 [] big_f($c1,$f1(Y1,Y2))| -big_f(Y1,$f1(Y1,Y2))|big_f(Y1,Y2).
% 1.72/1.95 0 [] -big_f($c1,$f1(Y1,Y2))| -big_f(Y2,$f1(Y1,Y2))|big_f(Y1,$f1(Y1,Y2)).
% 1.72/1.95 0 [] -big_f($c1,$f1(Y1,Y2))| -big_f(Y2,$f1(Y1,Y2))| -big_f(Y1,Y2).
% 1.72/1.95 end_of_list.
% 1.72/1.95
% 1.72/1.95 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.72/1.95
% 1.72/1.95 This is a non-Horn set without equality. The strategy will
% 1.72/1.95 be ordered hyper_res, unit deletion, and factoring, with
% 1.72/1.95 satellites in sos and with nuclei in usable.
% 1.72/1.95
% 1.72/1.95 dependent: set(hyper_res).
% 1.72/1.95 dependent: set(factor).
% 1.72/1.95 dependent: set(unit_deletion).
% 1.72/1.95
% 1.72/1.95 ------------> process usable:
% 1.72/1.95 ** KEPT (pick-wt=10): 1 [] -big_f($c1,$f1(A,B))|big_f($f1(A,B),$c1).
% 1.72/1.95 ** KEPT (pick-wt=10): 2 [] big_f($c1,$f1(A,B))| -big_f($f1(A,B),$c1).
% 1.72/1.95 ** KEPT (pick-wt=13): 3 [] big_f($c1,$f1(A,B))| -big_f(A,$f1(A,B))|big_f(A,B).
% 1.72/1.95 ** KEPT (pick-wt=15): 4 [] -big_f($c1,$f1(A,B))| -big_f(B,$f1(A,B))|big_f(A,$f1(A,B)).
% 1.72/1.95 ** KEPT (pick-wt=13): 5 [] -big_f($c1,$f1(A,B))| -big_f(B,$f1(A,B))| -big_f(A,B).
% 1.72/1.95
% 1.72/1.95 ------------> process sos:
% 1.72/1.95 ** KEPT (pick-wt=10): 8 [] big_f($c1,$f1(A,B))|big_f(B,$f1(A,B)).
% 1.72/1.95
% 1.72/1.95 ======= end of input processing =======
% 1.72/1.95
% 1.72/1.95 =========== start of search ===========
% 1.72/1.95
% 1.72/1.95 -------- PROOF --------
% 1.72/1.95
% 1.72/1.95 -----> EMPTY CLAUSE at 0.00 sec ----> 14 [hyper,13,7,9] $F.
% 1.72/1.95
% 1.72/1.95 Length of proof is 3. Level of proof is 2.
% 1.72/1.95
% 1.72/1.95 ---------------- PROOF ----------------
% 1.72/1.95 % SZS status Theorem
% 1.72/1.95 % SZS output start Refutation
% See solution above
% 1.72/1.95 ------------ end of proof -------------
% 1.72/1.95
% 1.72/1.95
% 1.72/1.95 Search stopped by max_proofs option.
% 1.72/1.95
% 1.72/1.95
% 1.72/1.95 Search stopped by max_proofs option.
% 1.72/1.95
% 1.72/1.95 ============ end of search ============
% 1.72/1.95
% 1.72/1.95 -------------- statistics -------------
% 1.72/1.95 clauses given 4
% 1.72/1.95 clauses generated 45
% 1.72/1.95 clauses kept 13
% 1.72/1.95 clauses forward subsumed 37
% 1.72/1.95 clauses back subsumed 1
% 1.72/1.95 Kbytes malloced 976
% 1.72/1.95
% 1.72/1.95 ----------- times (seconds) -----------
% 1.72/1.95 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.72/1.95 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.72/1.95 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.72/1.95
% 1.72/1.95 That finishes the proof of the theorem.
% 1.72/1.95
% 1.72/1.95 Process 19368 finished Wed Jul 27 10:41:32 2022
% 1.72/1.95 Otter interrupted
% 1.72/1.95 PROOF FOUND
%------------------------------------------------------------------------------