TSTP Solution File: SYN349+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SYN349+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n018.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:04 EDT 2022
% Result : Theorem 0.19s 0.45s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN349+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n018.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 : 600
% 0.12/0.34 % DateTime : Mon Jul 11 20:10:29 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox on n018.cluster.edu,
% 0.12/0.36 Mon Jul 11 20:10:29 2022
% 0.12/0.36 The command was "./sos". The process ID is 23223.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 formula_list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 0.12/0.36
% 0.12/0.36 This is a non-Horn set without equality. The strategy
% 0.12/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36
% 0.12/0.36 ======= 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: 15
% 0.12/0.38 number of clauses initially in problem: 18
% 0.12/0.38 percentage of clauses intially in UL: 83
% 0.12/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.38 percent of all initial clauses that are short: 100
% 0.12/0.38 absolute distinct symbol count: 3
% 0.12/0.38 distinct predicate count: 1
% 0.12/0.38 distinct function count: 2
% 0.12/0.38 distinct constant count: 0
% 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 ===========
% 0.19/0.45
% 0.19/0.45 -------- PROOF --------
% 0.19/0.45 % SZS status Theorem
% 0.19/0.45 % SZS output start Refutation
% 0.19/0.45
% 0.19/0.45 -----> EMPTY CLAUSE at 0.06 sec ----> 27 [hyper,25,15,24,23] {-} $F.
% 0.19/0.45
% 0.19/0.45 Length of proof is 8. Level of proof is 4.
% 0.19/0.45
% 0.19/0.45 ---------------- PROOF ----------------
% 0.19/0.45 % SZS status Theorem
% 0.19/0.45 % SZS output start Refutation
% 0.19/0.45
% 0.19/0.45 1 [] {+} -big_f(A,$f1(A,B))|big_f($f2(A),$f1(A,B)).
% 0.19/0.45 2 [] {+} big_f(A,$f1(A,B))| -big_f($f2(A),$f1(A,B)).
% 0.19/0.45 4 [] {+} -big_f(A,$f1(A,B))|big_f($f1(A,B),B)| -big_f(B,$f1(A,B))|big_f($f1(A,B),$f2(A)).
% 0.19/0.45 7 [] {+} big_f(A,$f1(A,B))| -big_f($f1(A,B),B)|big_f(B,$f1(A,B))| -big_f($f1(A,B),$f2(A)).
% 0.19/0.45 9 [] {+} -big_f(A,$f1(A,B))| -big_f($f1(A,B),B)| -big_f(B,$f1(A,B))| -big_f($f1(A,B),$f2(A)).
% 0.19/0.45 11 [factor,4.2.4] {+} -big_f(A,$f1(A,$f2(A)))|big_f($f1(A,$f2(A)),$f2(A))| -big_f($f2(A),$f1(A,$f2(A))).
% 0.19/0.45 13 [factor,7.2.4] {+} big_f(A,$f1(A,$f2(A)))| -big_f($f1(A,$f2(A)),$f2(A))|big_f($f2(A),$f1(A,$f2(A))).
% 0.19/0.45 15 [factor,9.2.4] {+} -big_f(A,$f1(A,$f2(A)))| -big_f($f1(A,$f2(A)),$f2(A))| -big_f($f2(A),$f1(A,$f2(A))).
% 0.19/0.45 16 [] {-} big_f(A,$f1(A,B))|big_f($f1(A,B),B)|big_f(B,$f1(A,B))|big_f($f1(A,B),$f2(A)).
% 0.19/0.45 20 [hyper,16,2,factor_simp,factor_simp] {-} big_f(A,$f1(A,$f2(A)))|big_f($f1(A,$f2(A)),$f2(A)).
% 0.19/0.45 22 [hyper,20,13,factor_simp] {-} big_f(A,$f1(A,$f2(A)))|big_f($f2(A),$f1(A,$f2(A))).
% 0.19/0.45 23 [hyper,22,1,factor_simp] {-} big_f($f2(A),$f1(A,$f2(A))).
% 0.19/0.45 24 [hyper,22,2,factor_simp] {-} big_f(A,$f1(A,$f2(A))).
% 0.19/0.45 25 [hyper,23,11,24] {-} big_f($f1(A,$f2(A)),$f2(A)).
% 0.19/0.45 27 [hyper,25,15,24,23] {-} $F.
% 0.19/0.45
% 0.19/0.45 % SZS output end Refutation
% 0.19/0.45 ------------ end of proof -------------
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 Search stopped by max_proofs option.
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 Search stopped by max_proofs option.
% 0.19/0.45
% 0.19/0.45 ============ end of search ============
% 0.19/0.45
% 0.19/0.45 ----------- soft-scott stats ----------
% 0.19/0.45
% 0.19/0.45 true clauses given 0 (0.0%)
% 0.19/0.45 false clauses given 7
% 0.19/0.45
% 0.19/0.45 FALSE TRUE
% 0.19/0.45 11 1 0
% 0.19/0.45 22 1 0
% 0.19/0.45 tot: 2 0 (0.0% true)
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.45
% 0.19/0.45 That finishes the proof of the theorem.
% 0.19/0.45
% 0.19/0.45 Process 23223 finished Mon Jul 11 20:10:29 2022
%------------------------------------------------------------------------------