TSTP Solution File: SYN591-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SYN591-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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:14:20 EDT 2022
% Result : Unsatisfiable 1.25s 1.43s
% Output : Refutation 1.25s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN591-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n020.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 : 600
% 0.12/0.33 % DateTime : Tue Jul 12 01:09:12 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n020.cluster.edu,
% 0.12/0.35 Tue Jul 12 01:09:12 2022
% 0.12/0.35 The command was "./sos". The process ID is 9770.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 0.12/0.35
% 0.12/0.35 This is a non-Horn set without equality. The strategy
% 0.12/0.35 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.35 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 24 back subsumes 18.
% 0.12/0.35 25 back subsumes 19.
% 0.12/0.35 26 back subsumes 20.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.38
% 0.12/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.38
% 0.12/0.38 Stopped by limit on number of solutions
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 -------------- Softie stats --------------
% 0.12/0.38
% 0.12/0.38 UPDATE_STOP: 300
% 0.12/0.38 SFINDER_TIME_LIMIT: 2
% 0.12/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.38 number of clauses in intial UL: 18
% 0.12/0.38 number of clauses initially in problem: 28
% 0.12/0.38 percentage of clauses intially in UL: 64
% 0.12/0.38 percentage of distinct symbols occuring in initial UL: 94
% 0.12/0.38 percent of all initial clauses that are short: 100
% 0.12/0.38 absolute distinct symbol count: 17
% 0.12/0.38 distinct predicate count: 8
% 0.12/0.38 distinct function count: 3
% 0.12/0.38 distinct constant count: 6
% 0.12/0.38
% 0.12/0.38 ---------- no more Softie stats ----------
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 =========== start of search ===========
% 1.25/1.43
% 1.25/1.43 -------- PROOF --------
% 1.25/1.43 % SZS status Unsatisfiable
% 1.25/1.43 % SZS output start Refutation
% 1.25/1.43
% 1.25/1.43 Model 2 (0.00 seconds, 0 Inserts)
% 1.25/1.43
% 1.25/1.43 Stopped by limit on number of solutions
% 1.25/1.43
% 1.25/1.43 Model 3 (0.00 seconds, 0 Inserts)
% 1.25/1.43
% 1.25/1.43 Stopped by limit on number of solutions
% 1.25/1.43
% 1.25/1.43 Stopped by limit on insertions
% 1.25/1.43
% 1.25/1.43 Model 4 (0.00 seconds, 0 Inserts)
% 1.25/1.43
% 1.25/1.43 Stopped by limit on number of solutions
% 1.25/1.43
% 1.25/1.43 Stopped by limit on insertions
% 1.25/1.43
% 1.25/1.43 Model 5 [ 3 1 3957 ] (0.00 seconds, 250000 Inserts)
% 1.25/1.43
% 1.25/1.43 Stopped by limit on insertions
% 1.25/1.43
% 1.25/1.43 Model 6 [ 3 1 18636 ] (0.00 seconds, 250000 Inserts)
% 1.25/1.43
% 1.25/1.43 Stopped by limit on insertions
% 1.25/1.43
% 1.25/1.43 Stopped by limit on insertions
% 1.25/1.43
% 1.25/1.43 Model 7 [ 4 0 143 ] (0.00 seconds, 250000 Inserts)
% 1.25/1.43
% 1.25/1.43 ----> UNIT CONFLICT at 1.05 sec ----> 100 [binary,99.1,3.1] {+} $F.
% 1.25/1.43
% 1.25/1.43 Length of proof is 7. Level of proof is 5.
% 1.25/1.43
% 1.25/1.43 ---------------- PROOF ----------------
% 1.25/1.43 % SZS status Unsatisfiable
% 1.25/1.43 % SZS output start Refutation
% 1.25/1.43
% 1.25/1.43 2 [] {+} -p11(c13,f4(c17,f6(c18))).
% 1.25/1.43 3 [] {+} -p11(c13,f4(f6(c18),c17)).
% 1.25/1.43 10 [] {+} p2(A,B)| -p2(C,A)| -p2(C,B).
% 1.25/1.43 12 [] {+} p2(f6(A),f5(A))| -p12(c14,f4(A,c17)).
% 1.25/1.43 15 [] {+} p11(A,B)| -p3(C,B)| -p7(D,A)| -p11(D,C).
% 1.25/1.43 16 [] {+} p3(f4(A,B),f4(C,D))| -p2(A,C)| -p2(B,D).
% 1.25/1.43 17 [] {+} p11(c13,f4(c17,f5(A)))|p11(c13,f4(f5(A),c17))| -p12(c14,f4(A,c17)).
% 1.25/1.43 24 [] {+} p7(A,A).
% 1.25/1.43 25 [] {-} p2(A,A).
% 1.25/1.43 31 [] {-} p12(c14,f4(c18,c17)).
% 1.25/1.43 35 [hyper,31,17] {-} p11(c13,f4(c17,f5(c18)))|p11(c13,f4(f5(c18),c17)).
% 1.25/1.43 36 [hyper,31,12] {+} p2(f6(c18),f5(c18)).
% 1.25/1.43 40 [hyper,36,10,25] {+} p2(f5(c18),f6(c18)).
% 1.25/1.43 45 [hyper,40,16,25] {+} p3(f4(A,f5(c18)),f4(A,f6(c18))).
% 1.25/1.43 47 [hyper,40,16,25] {+} p3(f4(f5(c18),A),f4(f6(c18),A)).
% 1.25/1.43 98 [hyper,45,15,24,35,unit_del,2] {-} p11(c13,f4(f5(c18),c17)).
% 1.25/1.43 99 [hyper,47,15,24,98] {-} p11(c13,f4(f6(c18),c17)).
% 1.25/1.43 100 [binary,99.1,3.1] {+} $F.
% 1.25/1.43
% 1.25/1.43 % SZS output end Refutation
% 1.25/1.43 ------------ end of proof -------------
% 1.25/1.43
% 1.25/1.43
% 1.25/1.43 Search stopped by max_proofs option.
% 1.25/1.43
% 1.25/1.43
% 1.25/1.43 Search stopped by max_proofs option.
% 1.25/1.43
% 1.25/1.43 ============ end of search ============
% 1.25/1.43
% 1.25/1.43 ----------- soft-scott stats ----------
% 1.25/1.43
% 1.25/1.43 true clauses given 16 (59.3%)
% 1.25/1.43 false clauses given 11
% 1.25/1.43
% 1.25/1.43 FALSE TRUE
% 1.25/1.43 9 0 8
% 1.25/1.43 11 0 10
% 1.25/1.43 13 0 16
% 1.25/1.43 15 0 16
% 1.25/1.43 tot: 0 50 (100.0% true)
% 1.25/1.43
% 1.25/1.43
% 1.25/1.43 Model 7 [ 4 0 143 ] (0.00 seconds, 250000 Inserts)
% 1.25/1.43
% 1.25/1.43 That finishes the proof of the theorem.
% 1.25/1.43
% 1.25/1.43 Process 9770 finished Tue Jul 12 01:09:13 2022
%------------------------------------------------------------------------------