TSTP Solution File: LCL006-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL006-1 : TPTP v8.1.0. Released v1.0.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 : Sun Jul 17 14:27:19 EDT 2022
% Result : Unsatisfiable 52.51s 52.68s
% Output : Refutation 52.51s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : LCL006-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.14 % Command : sos-script %s
% 0.14/0.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jul 3 22:25:51 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.37 ----- Otter 3.2, August 2001 -----
% 0.14/0.37 The process was started by sandbox on n026.cluster.edu,
% 0.14/0.37 Sun Jul 3 22:25:51 2022
% 0.14/0.37 The command was "./sos". The process ID is 26708.
% 0.14/0.37
% 0.14/0.37 set(prolog_style_variables).
% 0.14/0.37 set(auto).
% 0.14/0.37 dependent: set(auto1).
% 0.14/0.37 dependent: set(process_input).
% 0.14/0.37 dependent: clear(print_kept).
% 0.14/0.37 dependent: clear(print_new_demod).
% 0.14/0.37 dependent: clear(print_back_demod).
% 0.14/0.37 dependent: clear(print_back_sub).
% 0.14/0.37 dependent: set(control_memory).
% 0.14/0.37 dependent: assign(max_mem, 12000).
% 0.14/0.37 dependent: assign(pick_given_ratio, 4).
% 0.14/0.37 dependent: assign(stats_level, 1).
% 0.14/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.37 dependent: assign(sos_limit, 5000).
% 0.14/0.37 dependent: assign(max_weight, 60).
% 0.14/0.37 clear(print_given).
% 0.14/0.37
% 0.14/0.37 list(usable).
% 0.14/0.37
% 0.14/0.37 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.14/0.37
% 0.14/0.37 This is a Horn set without equality. The strategy will
% 0.14/0.37 be hyperresolution, with satellites in sos and nuclei
% 0.14/0.37 in usable.
% 0.14/0.37
% 0.14/0.37 dependent: set(hyper_res).
% 0.14/0.37 dependent: clear(order_hyper).
% 0.14/0.37
% 0.14/0.37 ------------> process usable:
% 0.14/0.37
% 0.14/0.37 ------------> process sos:
% 0.14/0.37
% 0.14/0.37 ======= end of input processing =======
% 0.21/0.42
% 0.21/0.42 Model 1 (0.00 seconds, 0 Inserts)
% 0.21/0.42
% 0.21/0.42 Stopped by limit on number of solutions
% 0.21/0.42
% 0.21/0.42
% 0.21/0.42 -------------- Softie stats --------------
% 0.21/0.42
% 0.21/0.42 UPDATE_STOP: 300
% 0.21/0.42 SFINDER_TIME_LIMIT: 2
% 0.21/0.42 SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.42 number of clauses in intial UL: 2
% 0.21/0.42 number of clauses initially in problem: 4
% 0.21/0.42 percentage of clauses intially in UL: 50
% 0.21/0.42 percentage of distinct symbols occuring in initial UL: 100
% 0.21/0.42 percent of all initial clauses that are short: 100
% 0.21/0.42 absolute distinct symbol count: 5
% 0.21/0.42 distinct predicate count: 1
% 0.21/0.42 distinct function count: 1
% 0.21/0.42 distinct constant count: 3
% 0.21/0.42
% 0.21/0.42 ---------- no more Softie stats ----------
% 0.21/0.42
% 0.21/0.42
% 0.21/0.42
% 0.21/0.42 Model 2 (0.00 seconds, 0 Inserts)
% 0.21/0.42
% 0.21/0.42 Stopped by limit on number of solutions
% 0.21/0.42
% 0.21/0.42 =========== start of search ===========
% 43.97/44.15
% 43.97/44.15
% 43.97/44.15 Changing weight limit from 60 to 24.
% 43.97/44.15
% 43.97/44.15 Model 3 [ 1 434 231575 ] (0.00 seconds, 234535 Inserts)
% 43.97/44.15
% 43.97/44.15 Model 4 [ 1 1 843 ] (0.00 seconds, 229423 Inserts)
% 43.97/44.15
% 43.97/44.15 Model 5 [ 1 0 712 ] (0.00 seconds, 227415 Inserts)
% 43.97/44.15
% 43.97/44.15 Model 6 [ 6 1 655 ] (0.00 seconds, 227432 Inserts)
% 43.97/44.15
% 43.97/44.15 Model 7 [ 2 438 231565 ] (0.00 seconds, 234352 Inserts)
% 43.97/44.15
% 43.97/44.15 Model 8 [ 7 0 892 ] (0.00 seconds, 235960 Inserts)
% 43.97/44.15
% 43.97/44.15 Model 9 [ 3 1 794 ] (0.00 seconds, 231317 Inserts)
% 43.97/44.15
% 43.97/44.15 Model 10 [ 7 0 400 ] (0.00 seconds, 229366 Inserts)
% 43.97/44.15
% 43.97/44.15 Resetting weight limit to 24 after 75 givens.
% 43.97/44.15
% 43.99/44.20
% 43.99/44.20
% 43.99/44.20 Changing weight limit from 24 to 20.
% 43.99/44.20
% 43.99/44.20 Resetting weight limit to 20 after 80 givens.
% 43.99/44.20
% 52.51/52.68
% 52.51/52.68 -- HEY sandbox, WE HAVE A PROOF!! --
% 52.51/52.68
% 52.51/52.68 Modelling stopped after 300 given clauses and 0.00 seconds
% 52.51/52.68
% 52.51/52.68
% 52.51/52.68 ----> UNIT CONFLICT at 52.17 sec ----> 106738 [binary,106737.1,2.1] {-} $F.
% 52.51/52.68
% 52.51/52.68 Length of proof is 18. Level of proof is 8.
% 52.51/52.68
% 52.51/52.68 ---------------- PROOF ----------------
% 52.51/52.68 % SZS status Unsatisfiable
% 52.51/52.68 % SZS output start Refutation
% 52.51/52.68
% 52.51/52.68 1 [] {+} -is_a_theorem(equivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 52.51/52.68 2 [] {+} -is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(c,a)),equivalent(b,c))).
% 52.51/52.68 3 [] {+} is_a_theorem(equivalent(equivalent(A,B),equivalent(B,A))).
% 52.51/52.68 4 [] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(A,equivalent(B,C)))).
% 52.51/52.68 5 [hyper,4,1,4] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(C,equivalent(A,equivalent(B,C))))).
% 52.51/52.68 6 [hyper,4,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(A,B),C))).
% 52.51/52.68 7 [hyper,4,1,3] {+} is_a_theorem(equivalent(A,equivalent(B,equivalent(B,A)))).
% 52.51/52.68 10 [hyper,7,1,3] {+} is_a_theorem(equivalent(equivalent(A,equivalent(A,B)),B)).
% 52.51/52.68 14 [hyper,10,1,4] {+} is_a_theorem(equivalent(A,equivalent(equivalent(A,B),B))).
% 52.51/52.68 21 [hyper,5,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(C,A))),equivalent(B,C))).
% 52.51/52.68 25 [hyper,5,1,3] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(C,B),A)))).
% 52.51/52.68 28 [hyper,14,1,5] {-} is_a_theorem(equivalent(A,equivalent(B,equivalent(equivalent(equivalent(B,C),C),A)))).
% 52.51/52.68 69 [hyper,6,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),C),A),equivalent(B,C))).
% 52.51/52.68 259 [hyper,25,1,6] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(C,B),A))).
% 52.51/52.68 419 [hyper,28,1,6] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(equivalent(B,C),C),A))).
% 52.51/52.68 2032 [hyper,69,1,21] {-} is_a_theorem(equivalent(A,equivalent(B,equivalent(C,equivalent(equivalent(B,C),A))))).
% 52.51/52.68 4552 [hyper,259,1,21] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(C,equivalent(B,equivalent(A,C))))).
% 52.51/52.68 5154 [hyper,419,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),B),C),equivalent(C,A))).
% 52.51/52.68 8284 [hyper,2032,1,6] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(C,equivalent(equivalent(B,C),A)))).
% 52.51/52.68 14556 [hyper,4552,1,6] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(B,equivalent(A,C)))).
% 52.51/52.68 43244 [hyper,8284,1,5154] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,A),equivalent(C,B))),C)).
% 52.51/52.68 106737 [hyper,43244,1,14556] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,A)),equivalent(B,C))).
% 52.51/52.68 106738 [binary,106737.1,2.1] {-} $F.
% 52.51/52.68
% 52.51/52.68 % SZS output end Refutation
% 52.51/52.68 ------------ end of proof -------------
% 52.51/52.68
% 52.51/52.68
% 52.51/52.68 Search stopped by max_proofs option.
% 52.51/52.68
% 52.51/52.68
% 52.51/52.68 Search stopped by max_proofs option.
% 52.51/52.68
% 52.51/52.68 ============ end of search ============
% 52.51/52.68
% 52.51/52.68 ----------- soft-scott stats ----------
% 52.51/52.68
% 52.51/52.68 true clauses given 52 (9.5%)
% 52.51/52.68 false clauses given 498
% 52.51/52.68
% 52.51/52.68 FALSE TRUE
% 52.51/52.68 12 62 70
% 52.51/52.68 16 2438 955
% 52.51/52.68 20 0 1475
% 52.51/52.68 tot: 2500 2500 (50.0% true)
% 52.51/52.68
% 52.51/52.68
% 52.51/52.68 Model 10 [ 7 0 400 ] (0.00 seconds, 229366 Inserts)
% 52.51/52.68
% 52.51/52.68 That finishes the proof of the theorem.
% 52.51/52.68
% 52.51/52.68 Process 26708 finished Sun Jul 3 22:26:43 2022
%------------------------------------------------------------------------------