TSTP Solution File: ALG011-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : ALG011-1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n028.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 14 18:00:52 EDT 2022
% Result : Unsatisfiable 0.39s 0.60s
% Output : Refutation 0.39s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ALG011-1 : TPTP v8.1.0. Released v2.7.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n028.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 : Wed Jun 8 03:30:30 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n028.cluster.edu,
% 0.12/0.35 Wed Jun 8 03:30:30 2022
% 0.12/0.35 The command was "./sos". The process ID is 4661.
% 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=1, symmetry=0, max_lits=3.
% 0.12/0.35
% 0.12/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.35 clauses in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.19/0.37
% 0.19/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.37
% 0.19/0.37 Stopped by limit on number of solutions
% 0.19/0.37
% 0.19/0.37
% 0.19/0.37 -------------- Softie stats --------------
% 0.19/0.37
% 0.19/0.37 UPDATE_STOP: 300
% 0.19/0.37 SFINDER_TIME_LIMIT: 2
% 0.19/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.37 number of clauses in intial UL: 5
% 0.19/0.37 number of clauses initially in problem: 11
% 0.19/0.37 percentage of clauses intially in UL: 45
% 0.19/0.37 percentage of distinct symbols occuring in initial UL: 50
% 0.19/0.37 percent of all initial clauses that are short: 100
% 0.19/0.37 absolute distinct symbol count: 6
% 0.19/0.37 distinct predicate count: 3
% 0.19/0.37 distinct function count: 1
% 0.19/0.37 distinct constant count: 2
% 0.19/0.37
% 0.19/0.37 ---------- no more Softie stats ----------
% 0.19/0.37
% 0.19/0.37
% 0.19/0.37
% 0.19/0.37 =========== start of search ===========
% 0.39/0.60
% 0.39/0.60 -------- PROOF --------
% 0.39/0.60 % SZS status Unsatisfiable
% 0.39/0.60 % SZS output start Refutation
% 0.39/0.60
% 0.39/0.60 Model 2 (0.00 seconds, 0 Inserts)
% 0.39/0.60
% 0.39/0.60 Stopped by limit on number of solutions
% 0.39/0.60
% 0.39/0.60 Model 3 (0.00 seconds, 0 Inserts)
% 0.39/0.60
% 0.39/0.60 Stopped by limit on number of solutions
% 0.39/0.60
% 0.39/0.60 Model 4 [ 1 0 34 ] (0.00 seconds, 174 Inserts)
% 0.39/0.60
% 0.39/0.60 -----> EMPTY CLAUSE at 0.22 sec ----> 845 [hyper,807,1,18] {-} $F.
% 0.39/0.60
% 0.39/0.60 Length of proof is 12. Level of proof is 7.
% 0.39/0.60
% 0.39/0.60 ---------------- PROOF ----------------
% 0.39/0.60 % SZS status Unsatisfiable
% 0.39/0.60 % SZS output start Refutation
% 0.39/0.60
% 0.39/0.60 1 [] {+} -c(A)| -d(A).
% 0.39/0.60 2 [] {+} d(f(A,B))| -c(A)| -c(B).
% 0.39/0.60 3 [] {+} c(f(A,B))| -d(A)| -d(B).
% 0.39/0.60 4 [factor,2.2.3] {+} d(f(A,A))| -c(A).
% 0.39/0.60 6 [] {-} f(A,f(B,C))=f(f(A,B),C).
% 0.39/0.60 8,7 [copy,6,flip.1] {-} f(f(A,B),C)=f(A,f(B,C)).
% 0.39/0.60 9 [] {+} c(A)|d(A).
% 0.39/0.60 10 [] {+} c(a1).
% 0.39/0.60 11 [] {+} d(a2).
% 0.39/0.60 15 [para_from,7.1.1,3.1.1] {-} c(f(A,f(B,C)))| -d(f(A,B))| -d(C).
% 0.39/0.60 16 [para_from,7.1.1,2.1.1] {-} d(f(A,f(B,C)))| -c(f(A,B))| -c(C).
% 0.39/0.60 18 [hyper,10,4] {+} d(f(a1,a1)).
% 0.39/0.60 22 [hyper,9,3,11] {+} c(A)|c(f(a2,A)).
% 0.39/0.60 81 [hyper,18,15,11] {-} c(f(a1,f(a1,a2))).
% 0.39/0.60 82 [hyper,18,15,9] {-} c(f(a1,f(a1,A)))|c(A).
% 0.39/0.60 96 [hyper,81,16,10,demod,8] {-} d(f(a1,f(a1,f(a2,a1)))).
% 0.39/0.60 243 [hyper,96,1,82] {+} c(f(a2,a1)).
% 0.39/0.60 428 [hyper,243,16,10] {-} d(f(a2,f(a1,a1))).
% 0.39/0.60 807 [hyper,428,1,22] {+} c(f(a1,a1)).
% 0.39/0.60 845 [hyper,807,1,18] {-} $F.
% 0.39/0.60
% 0.39/0.60 % SZS output end Refutation
% 0.39/0.60 ------------ end of proof -------------
% 0.39/0.60
% 0.39/0.60
% 0.39/0.60 Search stopped by max_proofs option.
% 0.39/0.60
% 0.39/0.60
% 0.39/0.60 Search stopped by max_proofs option.
% 0.39/0.60
% 0.39/0.60 ============ end of search ============
% 0.39/0.60
% 0.39/0.60 ----------- soft-scott stats ----------
% 0.39/0.60
% 0.39/0.60 true clauses given 8 (28.6%)
% 0.39/0.60 false clauses given 20
% 0.39/0.60
% 0.39/0.60 FALSE TRUE
% 0.39/0.60 4 0 1
% 0.39/0.60 6 3 4
% 0.39/0.60 8 10 6
% 0.39/0.60 10 21 22
% 0.39/0.60 12 50 50
% 0.39/0.60 14 58 104
% 0.39/0.60 16 50 83
% 0.39/0.60 18 62 70
% 0.39/0.60 20 45 57
% 0.39/0.60 22 21 18
% 0.39/0.60 24 19 13
% 0.39/0.60 28 2 2
% 0.39/0.60 tot: 341 430 (55.8% true)
% 0.39/0.60
% 0.39/0.60
% 0.39/0.60 Model 4 [ 1 0 34 ] (0.00 seconds, 174 Inserts)
% 0.39/0.60
% 0.39/0.60 That finishes the proof of the theorem.
% 0.39/0.60
% 0.39/0.60 Process 4661 finished Wed Jun 8 03:30:31 2022
%------------------------------------------------------------------------------