TSTP Solution File: SYN347-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SYN347-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n013.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 : 600s
% DateTime : Thu Jul 21 12:12:02 EDT 2022
% Result : Unsatisfiable 0.18s 0.51s
% Output : Refutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SYN347-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.10/0.11 % Command : sos-script %s
% 0.10/0.32 % Computer : n013.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 600
% 0.10/0.32 % DateTime : Mon Jul 11 21:31:29 EDT 2022
% 0.10/0.32 % CPUTime :
% 0.10/0.34 ----- Otter 3.2, August 2001 -----
% 0.10/0.34 The process was started by sandbox on n013.cluster.edu,
% 0.10/0.34 Mon Jul 11 21:31:29 2022
% 0.10/0.34 The command was "./sos". The process ID is 17695.
% 0.10/0.34
% 0.10/0.34 set(prolog_style_variables).
% 0.10/0.34 set(auto).
% 0.10/0.34 dependent: set(auto1).
% 0.10/0.34 dependent: set(process_input).
% 0.10/0.34 dependent: clear(print_kept).
% 0.10/0.34 dependent: clear(print_new_demod).
% 0.10/0.34 dependent: clear(print_back_demod).
% 0.10/0.34 dependent: clear(print_back_sub).
% 0.10/0.34 dependent: set(control_memory).
% 0.10/0.34 dependent: assign(max_mem, 12000).
% 0.10/0.34 dependent: assign(pick_given_ratio, 4).
% 0.10/0.34 dependent: assign(stats_level, 1).
% 0.10/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.10/0.34 dependent: assign(sos_limit, 5000).
% 0.10/0.34 dependent: assign(max_weight, 60).
% 0.10/0.34 clear(print_given).
% 0.10/0.34
% 0.10/0.34 list(usable).
% 0.10/0.34
% 0.10/0.34 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 0.10/0.34
% 0.10/0.34 This is a non-Horn set without equality. The strategy
% 0.10/0.34 will be ordered hyper_res, ur_res, unit deletion, and
% 0.10/0.34 factoring, with satellites in sos and nuclei in usable.
% 0.10/0.34
% 0.10/0.34 dependent: set(hyper_res).
% 0.10/0.34 dependent: set(factor).
% 0.10/0.34 dependent: set(unit_deletion).
% 0.10/0.34
% 0.10/0.34 ------------> process usable:
% 0.10/0.34
% 0.10/0.34 ------------> process sos:
% 0.10/0.34
% 0.10/0.34 ======= end of input processing =======
% 0.10/0.36
% 0.10/0.36 Model 1 (0.00 seconds, 0 Inserts)
% 0.10/0.36
% 0.10/0.36 Stopped by limit on number of solutions
% 0.10/0.36
% 0.10/0.36
% 0.10/0.36 -------------- Softie stats --------------
% 0.10/0.36
% 0.10/0.36 UPDATE_STOP: 300
% 0.10/0.36 SFINDER_TIME_LIMIT: 2
% 0.10/0.36 SHORT_CLAUSE_CUTOFF: 4
% 0.10/0.36 number of clauses in intial UL: 7
% 0.10/0.36 number of clauses initially in problem: 8
% 0.10/0.36 percentage of clauses intially in UL: 87
% 0.10/0.36 percentage of distinct symbols occuring in initial UL: 100
% 0.10/0.36 percent of all initial clauses that are short: 100
% 0.10/0.36 absolute distinct symbol count: 4
% 0.10/0.36 distinct predicate count: 1
% 0.10/0.36 distinct function count: 1
% 0.10/0.36 distinct constant count: 2
% 0.10/0.36
% 0.10/0.36 ---------- no more Softie stats ----------
% 0.10/0.36
% 0.10/0.36
% 0.10/0.36
% 0.10/0.36 =========== start of search ===========
% 0.18/0.51
% 0.18/0.51 -------- PROOF --------
% 0.18/0.51 % SZS status Unsatisfiable
% 0.18/0.51 % SZS output start Refutation
% 0.18/0.51
% 0.18/0.51 Stopped by limit on insertions
% 0.18/0.51
% 0.18/0.51 Model 2 [ 1 1 190 ] (0.00 seconds, 250000 Inserts)
% 0.18/0.51
% 0.18/0.51 -----> EMPTY CLAUSE at 0.14 sec ----> 34 [hyper,30,6,25] {-} $F.
% 0.18/0.51
% 0.18/0.51 Length of proof is 8. Level of proof is 4.
% 0.18/0.51
% 0.18/0.51 ---------------- PROOF ----------------
% 0.18/0.51 % SZS status Unsatisfiable
% 0.18/0.51 % SZS output start Refutation
% 0.18/0.51
% 0.18/0.51 1 [] {+} f(A,y(A,B))| -f(B,y(A,B))|f(a,b).
% 0.18/0.51 2 [] {+} -f(A,y(A,B))|f(B,y(A,B))|f(a,b).
% 0.18/0.51 3 [] {+} -f(A,y(A,B))| -f(B,y(A,B))| -f(a,b).
% 0.18/0.51 4 [] {+} f(A,y(A,B))|f(B,y(A,B))| -f(a,b).
% 0.18/0.51 5 [] {+} -f(a,y(A,B))| -f(b,y(A,B)).
% 0.18/0.51 6 [factor,3.1.2] {+} -f(A,y(A,A))| -f(a,b).
% 0.18/0.51 7 [factor,4.1.2] {+} f(A,y(A,A))| -f(a,b).
% 0.18/0.51 8 [] {-} f(a,y(A,B))|f(b,y(A,B)).
% 0.18/0.51 10 [hyper,8,1] {-} f(b,y(A,a))|f(A,y(A,a))|f(a,b).
% 0.18/0.51 11 [hyper,8,2] {-} f(a,y(b,A))|f(A,y(b,A))|f(a,b).
% 0.18/0.51 14 [factor,10.1.2] {-} f(b,y(b,a))|f(a,b).
% 0.18/0.51 15 [factor,11.1.2] {-} f(a,y(b,a))|f(a,b).
% 0.18/0.51 25 [hyper,15,5,14,factor_simp] {-} f(a,b).
% 0.18/0.51 30 [hyper,25,7] {+} f(A,y(A,A)).
% 0.18/0.51 34 [hyper,30,6,25] {-} $F.
% 0.18/0.51
% 0.18/0.51 % SZS output end Refutation
% 0.18/0.51 ------------ end of proof -------------
% 0.18/0.51
% 0.18/0.51
% 0.18/0.51 Search stopped by max_proofs option.
% 0.18/0.51
% 0.18/0.51
% 0.18/0.51 Search stopped by max_proofs option.
% 0.18/0.51
% 0.18/0.51 ============ end of search ============
% 0.18/0.51
% 0.18/0.51 ----------- soft-scott stats ----------
% 0.18/0.51
% 0.18/0.51 true clauses given 0 (0.0%)
% 0.18/0.51 false clauses given 6
% 0.18/0.51
% 0.18/0.51 FALSE TRUE
% 0.18/0.51 5 2 0
% 0.18/0.51 10 1 0
% 0.18/0.51 tot: 3 0 (0.0% true)
% 0.18/0.51
% 0.18/0.51
% 0.18/0.51 Model 2 [ 1 1 190 ] (0.00 seconds, 250000 Inserts)
% 0.18/0.51
% 0.18/0.51 That finishes the proof of the theorem.
% 0.18/0.51
% 0.18/0.51 Process 17695 finished Mon Jul 11 21:31:30 2022
%------------------------------------------------------------------------------