TSTP Solution File: LCL011-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL011-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n012.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 : Sun Jul 17 14:27:21 EDT 2022
% Result : Unsatisfiable 33.51s 33.76s
% Output : Refutation 33.51s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL011-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n012.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 : Sun Jul 3 22:09:16 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 n012.cluster.edu,
% 0.12/0.35 Sun Jul 3 22:09:16 2022
% 0.12/0.35 The command was "./sos". The process ID is 1064.
% 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=1, equality=0, symmetry=0, max_lits=3.
% 0.12/0.35
% 0.12/0.35 This is a Horn set without equality. The strategy will
% 0.12/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.12/0.35 in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: clear(order_hyper).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.19/0.38
% 0.19/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.38
% 0.19/0.38 Stopped by limit on number of solutions
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 -------------- Softie stats --------------
% 0.19/0.38
% 0.19/0.38 UPDATE_STOP: 300
% 0.19/0.38 SFINDER_TIME_LIMIT: 2
% 0.19/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.38 number of clauses in intial UL: 2
% 0.19/0.38 number of clauses initially in problem: 3
% 0.19/0.38 percentage of clauses intially in UL: 66
% 0.19/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.38 percent of all initial clauses that are short: 100
% 0.19/0.38 absolute distinct symbol count: 5
% 0.19/0.38 distinct predicate count: 1
% 0.19/0.38 distinct function count: 1
% 0.19/0.38 distinct constant count: 3
% 0.19/0.38
% 0.19/0.38 ---------- no more Softie stats ----------
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 =========== start of search ===========
% 32.96/33.17
% 32.96/33.17
% 32.96/33.17 Changing weight limit from 60 to 28.
% 32.96/33.17
% 32.96/33.17 Model 2 (0.00 seconds, 0 Inserts)
% 32.96/33.17
% 32.96/33.17 Stopped by limit on number of solutions
% 32.96/33.17
% 32.96/33.17 Model 3 [ 1 1 820 ] (0.00 seconds, 192284 Inserts)
% 32.96/33.17
% 32.96/33.17 Model 4 [ 1 1 536 ] (0.00 seconds, 191023 Inserts)
% 32.96/33.17
% 32.96/33.17 Model 5 [ 2 1 452 ] (0.00 seconds, 191495 Inserts)
% 32.96/33.17
% 32.96/33.17 Model 6 [ 10 1 212 ] (0.00 seconds, 190050 Inserts)
% 32.96/33.17
% 32.96/33.17 Model 7 [ 5 0 98 ] (0.00 seconds, 190488 Inserts)
% 32.96/33.17
% 32.96/33.17 Model 8 [ 6 0 27 ] (0.00 seconds, 191020 Inserts)
% 32.96/33.17
% 32.96/33.17 Model 9 [ 6 1 1033 ] (0.00 seconds, 191750 Inserts)
% 32.96/33.17
% 32.96/33.17 Resetting weight limit to 28 after 85 givens.
% 32.96/33.17
% 33.05/33.24
% 33.05/33.24
% 33.05/33.24 Changing weight limit from 28 to 24.
% 33.05/33.24
% 33.05/33.24 Resetting weight limit to 24 after 90 givens.
% 33.05/33.24
% 33.12/33.34
% 33.12/33.34
% 33.12/33.34 Changing weight limit from 24 to 20.
% 33.12/33.34
% 33.12/33.34 Resetting weight limit to 20 after 100 givens.
% 33.12/33.34
% 33.51/33.76
% 33.51/33.76 -- HEY sandbox, WE HAVE A PROOF!! --
% 33.51/33.76
% 33.51/33.76 ----> UNIT CONFLICT at 33.36 sec ----> 8871 [binary,8870.1,2.1] {-} $F.
% 33.51/33.76
% 33.51/33.76 Length of proof is 12. Level of proof is 9.
% 33.51/33.76
% 33.51/33.76 ---------------- PROOF ----------------
% 33.51/33.76 % SZS status Unsatisfiable
% 33.51/33.76 % SZS output start Refutation
% 33.51/33.76
% 33.51/33.76 1 [] {+} -is_a_theorem(equivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 33.51/33.76 2 [] {+} -is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(a,c),equivalent(c,b)))).
% 33.51/33.76 3 [] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(C,A),equivalent(B,C)))).
% 33.51/33.76 4 [hyper,3,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(equivalent(D,B),equivalent(C,D)),A))).
% 33.51/33.76 5 [hyper,4,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(D,B))),equivalent(E,A)),equivalent(E,equivalent(C,D)))).
% 33.51/33.76 7 [hyper,4,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(D,B),A)),equivalent(C,D))).
% 33.51/33.76 10 [hyper,7,1,4] {+} is_a_theorem(equivalent(A,equivalent(B,equivalent(A,B)))).
% 33.51/33.76 12 [hyper,10,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(C,B),A)),C)).
% 33.51/33.76 20 [hyper,12,1,4] {+} is_a_theorem(equivalent(A,A)).
% 33.51/33.76 40 [hyper,20,1,10] {+} is_a_theorem(equivalent(A,equivalent(equivalent(B,B),A))).
% 33.51/33.76 42 [hyper,20,1,3] {+} is_a_theorem(equivalent(equivalent(A,B),equivalent(B,A))).
% 33.51/33.76 80 [hyper,42,1,40] {-} is_a_theorem(equivalent(equivalent(A,A),equivalent(equivalent(B,C),equivalent(C,B)))).
% 33.51/33.76 85 [hyper,42,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(C,B),A))).
% 33.51/33.76 761 [hyper,80,1,5] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(B,C)),equivalent(C,A))).
% 33.51/33.76 8870 [hyper,761,1,85] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,C),equivalent(C,B)))).
% 33.51/33.76 8871 [binary,8870.1,2.1] {-} $F.
% 33.51/33.76
% 33.51/33.76 % SZS output end Refutation
% 33.51/33.76 ------------ end of proof -------------
% 33.51/33.76
% 33.51/33.76
% 33.51/33.76 Search stopped by max_proofs option.
% 33.51/33.76
% 33.51/33.76
% 33.51/33.76 Search stopped by max_proofs option.
% 33.51/33.76
% 33.51/33.76 ============ end of search ============
% 33.51/33.76
% 33.51/33.76 ----------- soft-scott stats ----------
% 33.51/33.76
% 33.51/33.76 true clauses given 7 (4.2%)
% 33.51/33.76 false clauses given 160
% 33.51/33.76
% 33.51/33.76 FALSE TRUE
% 33.51/33.76 12 213 92
% 33.51/33.76 16 2303 258
% 33.51/33.76 20 62 24
% 33.51/33.76 tot: 2578 374 (12.7% true)
% 33.51/33.76
% 33.51/33.76
% 33.51/33.76 Model 9 [ 6 1 1033 ] (0.00 seconds, 191750 Inserts)
% 33.51/33.76
% 33.51/33.76 That finishes the proof of the theorem.
% 33.51/33.76
% 33.51/33.76 Process 1064 finished Sun Jul 3 22:09:50 2022
%------------------------------------------------------------------------------