TSTP Solution File: SYO629-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SYO629-1 : TPTP v8.1.0. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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 19:50:03 EDT 2022
% Result : Unsatisfiable 0.39s 0.62s
% Output : Refutation 0.39s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO629-1 : TPTP v8.1.0. Released v7.1.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n026.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jul 9 08:20:25 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.36 ----- Otter 3.2, August 2001 -----
% 0.20/0.36 The process was started by sandbox on n026.cluster.edu,
% 0.20/0.36 Sat Jul 9 08:20:25 2022
% 0.20/0.36 The command was "./sos". The process ID is 20170.
% 0.20/0.36
% 0.20/0.36 set(prolog_style_variables).
% 0.20/0.36 set(auto).
% 0.20/0.36 dependent: set(auto1).
% 0.20/0.36 dependent: set(process_input).
% 0.20/0.36 dependent: clear(print_kept).
% 0.20/0.36 dependent: clear(print_new_demod).
% 0.20/0.36 dependent: clear(print_back_demod).
% 0.20/0.36 dependent: clear(print_back_sub).
% 0.20/0.36 dependent: set(control_memory).
% 0.20/0.36 dependent: assign(max_mem, 12000).
% 0.20/0.36 dependent: assign(pick_given_ratio, 4).
% 0.20/0.36 dependent: assign(stats_level, 1).
% 0.20/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.36 dependent: assign(sos_limit, 5000).
% 0.20/0.36 dependent: assign(max_weight, 60).
% 0.20/0.36 clear(print_given).
% 0.20/0.36
% 0.20/0.36 list(usable).
% 0.20/0.36
% 0.20/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 0.20/0.36
% 0.20/0.36 This is a non-Horn set without equality. The strategy
% 0.20/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.20/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.20/0.36
% 0.20/0.36 dependent: set(hyper_res).
% 0.20/0.36 dependent: set(factor).
% 0.20/0.36 dependent: set(unit_deletion).
% 0.20/0.36
% 0.20/0.36 ------------> process usable:
% 0.20/0.36 Following clause subsumed by 4 during input processing: 0 [] {-} -'LE'(f(g(A)),'0').
% 0.20/0.36 Following clause subsumed by 1 during input processing: 0 [] {-} -'E'(f(A),f(g(A))).
% 0.20/0.36
% 0.20/0.36 ------------> process sos:
% 0.20/0.36 Following clause subsumed by 11 during input processing: 0 [] {-} iLEQ(A,g(A)).
% 0.20/0.36 Following clause subsumed by 9 during input processing: 0 [] {-} iLEQ(A,A).
% 0.20/0.36
% 0.20/0.36 ======= end of input processing =======
% 0.20/0.40
% 0.20/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 -------------- Softie stats --------------
% 0.20/0.40
% 0.20/0.40 UPDATE_STOP: 300
% 0.20/0.40 SFINDER_TIME_LIMIT: 2
% 0.20/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.40 number of clauses in intial UL: 5
% 0.20/0.40 number of clauses initially in problem: 8
% 0.20/0.40 percentage of clauses intially in UL: 62
% 0.20/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.40 percent of all initial clauses that are short: 100
% 0.20/0.40 absolute distinct symbol count: 7
% 0.20/0.40 distinct predicate count: 3
% 0.20/0.40 distinct function count: 3
% 0.20/0.40 distinct constant count: 1
% 0.20/0.40
% 0.20/0.40 ---------- no more Softie stats ----------
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40 =========== start of search ===========
% 0.39/0.62
% 0.39/0.62 -------- PROOF --------
% 0.39/0.62 % SZS status Unsatisfiable
% 0.39/0.62 % SZS output start Refutation
% 0.39/0.62
% 0.39/0.62 Stopped by limit on insertions
% 0.39/0.62
% 0.39/0.62 -----> EMPTY CLAUSE at 0.24 sec ----> 24 [hyper,21,8,21] {-} $F.
% 0.39/0.62
% 0.39/0.62 Length of proof is 6. Level of proof is 3.
% 0.39/0.62
% 0.39/0.62 ---------------- PROOF ----------------
% 0.39/0.62 % SZS status Unsatisfiable
% 0.39/0.62 % SZS output start Refutation
% 0.39/0.62
% 0.39/0.62 1 [] {+} -'E'(f(A),f(g(A))).
% 0.39/0.62 2 [] {-} -'E'('0',f(A))| -'E'('0',f(g(A)))|'E'(f(A),f(g(A))).
% 0.39/0.62 3 [copy,2,unit_del,1] {+} -'E'('0',f(A))| -'E'('0',f(g(A))).
% 0.39/0.62 4 [] {+} -'LE'(f(A),'0').
% 0.39/0.62 5 [] {-} -'LE'(f(A),s('0'))| -iLEQ(A,B)|'E'('0',f(B))|'LE'(f(B),'0').
% 0.39/0.62 6 [copy,5,unit_del,4] {+} -'LE'(f(A),s('0'))| -iLEQ(A,B)|'E'('0',f(B)).
% 0.39/0.62 7 [] {-} -'E'(s('0'),f(A))| -'E'(s('0'),f(g(A)))|'E'(f(A),f(g(A))).
% 0.39/0.62 8 [copy,7,unit_del,1] {+} -'E'(s('0'),f(A))| -'E'(s('0'),f(g(A))).
% 0.39/0.62 9 [] {+} iLEQ(A,A).
% 0.39/0.62 10 [] {-} 'E'(s('0'),f(A))|'LE'(f(A),s('0')).
% 0.39/0.62 11 [] {+} iLEQ(A,g(A)).
% 0.39/0.62 12 [hyper,10,6,9] {-} 'E'(s('0'),f(A))|'E'('0',f(A)).
% 0.39/0.62 18 [hyper,11,6,10] {-} 'E'('0',f(g(A)))|'E'(s('0'),f(A)).
% 0.39/0.62 21 [hyper,18,3,12,factor_simp] {-} 'E'(s('0'),f(A)).
% 0.39/0.62 24 [hyper,21,8,21] {-} $F.
% 0.39/0.62
% 0.39/0.62 % SZS output end Refutation
% 0.39/0.62 ------------ end of proof -------------
% 0.39/0.62
% 0.39/0.62
% 0.39/0.62 Search stopped by max_proofs option.
% 0.39/0.62
% 0.39/0.62
% 0.39/0.62 Search stopped by max_proofs option.
% 0.39/0.62
% 0.39/0.62 ============ end of search ============
% 0.39/0.62
% 0.39/0.62 ----------- soft-scott stats ----------
% 0.39/0.62
% 0.39/0.62 true clauses given 1 (12.5%)
% 0.39/0.62 false clauses given 7
% 0.39/0.62
% 0.39/0.62 FALSE TRUE
% 0.39/0.62 5 1 0
% 0.39/0.62 tot: 1 0 (0.0% true)
% 0.39/0.62
% 0.39/0.62
% 0.39/0.62 Model 2 (0.00 seconds, 0 Inserts)
% 0.39/0.62
% 0.39/0.62 That finishes the proof of the theorem.
% 0.39/0.62
% 0.39/0.62 Process 20170 finished Sat Jul 9 08:20:25 2022
%------------------------------------------------------------------------------