TSTP Solution File: LCL129-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL129-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n009.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:28:07 EDT 2022
% Result : Unsatisfiable 30.78s 30.95s
% Output : Refutation 30.78s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LCL129-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : sos-script %s
% 0.11/0.32 % Computer : n009.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sat Jul 2 15:37:07 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.11/0.34 ----- Otter 3.2, August 2001 -----
% 0.11/0.34 The process was started by sandbox on n009.cluster.edu,
% 0.11/0.34 Sat Jul 2 15:37:07 2022
% 0.11/0.34 The command was "./sos". The process ID is 17186.
% 0.11/0.34
% 0.11/0.34 set(prolog_style_variables).
% 0.11/0.34 set(auto).
% 0.11/0.34 dependent: set(auto1).
% 0.11/0.34 dependent: set(process_input).
% 0.11/0.34 dependent: clear(print_kept).
% 0.11/0.34 dependent: clear(print_new_demod).
% 0.11/0.34 dependent: clear(print_back_demod).
% 0.11/0.34 dependent: clear(print_back_sub).
% 0.11/0.34 dependent: set(control_memory).
% 0.11/0.34 dependent: assign(max_mem, 12000).
% 0.11/0.34 dependent: assign(pick_given_ratio, 4).
% 0.11/0.34 dependent: assign(stats_level, 1).
% 0.11/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.11/0.34 dependent: assign(sos_limit, 5000).
% 0.11/0.34 dependent: assign(max_weight, 60).
% 0.11/0.34 clear(print_given).
% 0.11/0.34
% 0.11/0.34 list(usable).
% 0.11/0.34
% 0.11/0.34 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.11/0.34
% 0.11/0.34 This is a Horn set without equality. The strategy will
% 0.11/0.34 be hyperresolution, with satellites in sos and nuclei
% 0.11/0.34 in usable.
% 0.11/0.34
% 0.11/0.34 dependent: set(hyper_res).
% 0.11/0.34 dependent: clear(order_hyper).
% 0.11/0.34
% 0.11/0.34 ------------> process usable:
% 0.11/0.34
% 0.11/0.34 ------------> process sos:
% 0.11/0.34
% 0.11/0.34 ======= end of input processing =======
% 0.18/0.37
% 0.18/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.37
% 0.18/0.37 Stopped by limit on number of solutions
% 0.18/0.37
% 0.18/0.37
% 0.18/0.37 -------------- Softie stats --------------
% 0.18/0.37
% 0.18/0.37 UPDATE_STOP: 300
% 0.18/0.37 SFINDER_TIME_LIMIT: 2
% 0.18/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.37 number of clauses in intial UL: 2
% 0.18/0.37 number of clauses initially in problem: 3
% 0.18/0.37 percentage of clauses intially in UL: 66
% 0.18/0.37 percentage of distinct symbols occuring in initial UL: 100
% 0.18/0.37 percent of all initial clauses that are short: 100
% 0.18/0.37 absolute distinct symbol count: 6
% 0.18/0.37 distinct predicate count: 1
% 0.18/0.37 distinct function count: 1
% 0.18/0.37 distinct constant count: 4
% 0.18/0.37
% 0.18/0.37 ---------- no more Softie stats ----------
% 0.18/0.37
% 0.18/0.37
% 0.18/0.37
% 0.18/0.37 =========== start of search ===========
% 5.05/5.23
% 5.05/5.23
% 5.05/5.23 Changing weight limit from 60 to 36.
% 5.05/5.23
% 5.05/5.23 Model 2 (0.00 seconds, 0 Inserts)
% 5.05/5.23
% 5.05/5.23 Stopped by limit on number of solutions
% 5.05/5.23
% 5.05/5.23 Stopped by limit on insertions
% 5.05/5.23
% 5.05/5.23 Model 3 (0.00 seconds, 0 Inserts)
% 5.05/5.23
% 5.05/5.23 Stopped by limit on number of solutions
% 5.05/5.23
% 5.05/5.23 Resetting weight limit to 36 after 110 givens.
% 5.05/5.23
% 5.05/5.26
% 5.05/5.26
% 5.05/5.26 Changing weight limit from 36 to 32.
% 5.05/5.26
% 5.05/5.26 Resetting weight limit to 32 after 115 givens.
% 5.05/5.26
% 5.12/5.34
% 5.12/5.34
% 5.12/5.34 Changing weight limit from 32 to 28.
% 5.12/5.34
% 5.12/5.34 Resetting weight limit to 28 after 120 givens.
% 5.12/5.34
% 5.28/5.49
% 5.28/5.49
% 5.28/5.49 Changing weight limit from 28 to 24.
% 5.28/5.49
% 5.28/5.49 Resetting weight limit to 24 after 130 givens.
% 5.28/5.49
% 30.78/30.95
% 30.78/30.95 -- HEY sandbox, WE HAVE A PROOF!! --
% 30.78/30.95
% 30.78/30.95 Modelling stopped after 300 given clauses and 0.00 seconds
% 30.78/30.95
% 30.78/30.95
% 30.78/30.95 ----> UNIT CONFLICT at 29.97 sec ----> 166512 [binary,166511.1,2.1] {-} $F.
% 30.78/30.95
% 30.78/30.95 Length of proof is 22. Level of proof is 12.
% 30.78/30.95
% 30.78/30.95 ---------------- PROOF ----------------
% 30.78/30.95 % SZS status Unsatisfiable
% 30.78/30.95 % SZS output start Refutation
% 30.78/30.95
% 30.78/30.95 1 [] {+} -is_a_theorem(equivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 30.78/30.95 2 [] {+} -is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))).
% 30.78/30.95 3 [] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(A,equivalent(D,C)),equivalent(B,D)))).
% 30.78/30.95 4 [hyper,3,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(D,equivalent(B,E))),equivalent(equivalent(A,equivalent(E,C)),D))).
% 30.78/30.95 5 [hyper,4,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(D,equivalent(B,E))),equivalent(F,D)),equivalent(equivalent(A,equivalent(E,C)),F))).
% 30.78/30.95 6 [hyper,4,1,3] {+} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(A,equivalent(B,C)))).
% 30.78/30.95 7 [hyper,6,1,4] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,B)),A)).
% 30.78/30.95 9 [hyper,7,1,7] {+} is_a_theorem(equivalent(equivalent(A,A),equivalent(B,B))).
% 30.78/30.95 10 [hyper,7,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(C,B)),A)).
% 30.78/30.95 11 [hyper,7,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(C,C)),equivalent(D,B)),equivalent(A,D))).
% 30.78/30.95 14 [hyper,9,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),equivalent(A,C))).
% 30.78/30.95 15 [hyper,9,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(A,A),equivalent(B,C)),equivalent(C,B))).
% 30.78/30.95 22 [hyper,15,1,3] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,C),equivalent(B,C)))).
% 30.78/30.95 24 [hyper,11,1,3] {-} is_a_theorem(equivalent(A,equivalent(equivalent(A,equivalent(B,C)),equivalent(C,B)))).
% 30.78/30.95 25 [hyper,22,1,22] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(equivalent(A,D),equivalent(B,D)),C))).
% 30.78/30.95 57 [hyper,24,1,5] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(equivalent(A,equivalent(D,C)),equivalent(equivalent(E,F),equivalent(D,B))),equivalent(F,E)))).
% 30.78/30.95 58 [hyper,24,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,D))),equivalent(equivalent(A,equivalent(D,C)),B))).
% 30.78/30.95 272 [hyper,25,1,22] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,B)),equivalent(equivalent(A,D),equivalent(C,D)))).
% 30.78/30.95 280 [hyper,25,1,14] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),C),equivalent(equivalent(D,B),C)),equivalent(A,D))).
% 30.78/30.95 282 [hyper,25,1,10] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,C)),D),equivalent(equivalent(C,B),D)),A)).
% 30.78/30.95 4978 [hyper,280,1,57] {-} is_a_theorem(equivalent(A,equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(D,C))),equivalent(D,B)))).
% 30.78/30.95 4984 [hyper,282,1,272] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,C),D)),equivalent(C,B)),D),E),equivalent(A,E))).
% 30.78/30.95 17072 [hyper,4978,1,58] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(A,equivalent(equivalent(B,D),equivalent(C,D))))).
% 30.78/30.95 24097 [hyper,17072,1,58] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(C,D),equivalent(B,D))),A)).
% 30.78/30.95 166511 [hyper,4984,1,24097] {-} is_a_theorem(equivalent(A,equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(B,D),equivalent(C,D)))))).
% 30.78/30.95 166512 [binary,166511.1,2.1] {-} $F.
% 30.78/30.95
% 30.78/30.95 % SZS output end Refutation
% 30.78/30.95 ------------ end of proof -------------
% 30.78/30.95
% 30.78/30.95
% 30.78/30.95 Search stopped by max_proofs option.
% 30.78/30.95
% 30.78/30.95
% 30.78/30.95 Search stopped by max_proofs option.
% 30.78/30.95
% 30.78/30.95 ============ end of search ============
% 30.78/30.95
% 30.78/30.95 ----------- soft-scott stats ----------
% 30.78/30.95
% 30.78/30.95 true clauses given 365 (20.4%)
% 30.78/30.95 false clauses given 1427
% 30.78/30.95
% 30.78/30.95 FALSE TRUE
% 30.78/30.95 20 2500 1070
% 30.78/30.95 24 164 1430
% 30.78/30.95 tot: 2664 2500 (48.4% true)
% 30.78/30.95
% 30.78/30.95
% 30.78/30.95 Model 3 (0.00 seconds, 0 Inserts)
% 30.78/30.95
% 30.78/30.95 That finishes the proof of the theorem.
% 30.78/30.95
% 30.78/30.95 Process 17186 finished Sat Jul 2 15:37:38 2022
%------------------------------------------------------------------------------