TSTP Solution File: LCL257-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL257-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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:29:11 EDT 2022
% Result : Unsatisfiable 21.35s 21.54s
% Output : Refutation 21.35s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL257-1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n020.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sat Jul 2 16:43:30 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.36 ----- Otter 3.2, August 2001 -----
% 0.14/0.36 The process was started by sandbox2 on n020.cluster.edu,
% 0.14/0.36 Sat Jul 2 16:43:30 2022
% 0.14/0.36 The command was "./sos". The process ID is 14981.
% 0.14/0.36
% 0.14/0.36 set(prolog_style_variables).
% 0.14/0.36 set(auto).
% 0.14/0.36 dependent: set(auto1).
% 0.14/0.36 dependent: set(process_input).
% 0.14/0.36 dependent: clear(print_kept).
% 0.14/0.36 dependent: clear(print_new_demod).
% 0.14/0.36 dependent: clear(print_back_demod).
% 0.14/0.36 dependent: clear(print_back_sub).
% 0.14/0.36 dependent: set(control_memory).
% 0.14/0.36 dependent: assign(max_mem, 12000).
% 0.14/0.36 dependent: assign(pick_given_ratio, 4).
% 0.14/0.36 dependent: assign(stats_level, 1).
% 0.14/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.36 dependent: assign(sos_limit, 5000).
% 0.14/0.36 dependent: assign(max_weight, 60).
% 0.14/0.36 clear(print_given).
% 0.14/0.36
% 0.14/0.36 list(usable).
% 0.14/0.36
% 0.14/0.36 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.14/0.36
% 0.14/0.36 This is a Horn set without equality. The strategy will
% 0.14/0.36 be hyperresolution, with satellites in sos and nuclei
% 0.14/0.36 in usable.
% 0.14/0.36
% 0.14/0.36 dependent: set(hyper_res).
% 0.14/0.36 dependent: clear(order_hyper).
% 0.14/0.36
% 0.14/0.36 ------------> process usable:
% 0.14/0.36
% 0.14/0.36 ------------> process sos:
% 0.14/0.36
% 0.14/0.36 ======= end of input processing =======
% 0.14/0.38
% 0.14/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.38
% 0.14/0.38 Stopped by limit on number of solutions
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 -------------- Softie stats --------------
% 0.14/0.38
% 0.14/0.38 UPDATE_STOP: 300
% 0.14/0.38 SFINDER_TIME_LIMIT: 2
% 0.14/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.38 number of clauses in intial UL: 2
% 0.14/0.38 number of clauses initially in problem: 3
% 0.14/0.38 percentage of clauses intially in UL: 66
% 0.14/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.14/0.38 percent of all initial clauses that are short: 100
% 0.14/0.38 absolute distinct symbol count: 5
% 0.14/0.38 distinct predicate count: 1
% 0.14/0.38 distinct function count: 1
% 0.14/0.38 distinct constant count: 3
% 0.14/0.38
% 0.14/0.38 ---------- no more Softie stats ----------
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 =========== start of search ===========
% 21.35/21.54
% 21.35/21.54 -- HEY sandbox2, WE HAVE A PROOF!! --
% 21.35/21.54
% 21.35/21.54 Model 2 (0.00 seconds, 0 Inserts)
% 21.35/21.54
% 21.35/21.54 Stopped by limit on number of solutions
% 21.35/21.54
% 21.35/21.54 Model 3 [ 1 425 220289 ] (0.00 seconds, 222688 Inserts)
% 21.35/21.54
% 21.35/21.54 Model 4 [ 1 0 1016 ] (0.00 seconds, 217728 Inserts)
% 21.35/21.54
% 21.35/21.54 Model 5 [ 3 0 678 ] (0.00 seconds, 214928 Inserts)
% 21.35/21.54
% 21.35/21.54 ----> UNIT CONFLICT at 21.15 sec ----> 98 [binary,97.1,2.1] {+} $F.
% 21.35/21.54
% 21.35/21.54 Length of proof is 8. Level of proof is 6.
% 21.35/21.54
% 21.35/21.54 ---------------- PROOF ----------------
% 21.35/21.54 % SZS status Unsatisfiable
% 21.35/21.54 % SZS output start Refutation
% 21.35/21.54
% 21.35/21.54 1 [] {+} -is_a_theorem(equivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 21.35/21.54 2 [] {+} -is_a_theorem(equivalent(x,equivalent(equivalent(y,z),equivalent(equivalent(z,x),y)))).
% 21.35/21.54 3 [] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(C,B),equivalent(A,C)))).
% 21.35/21.54 4 [hyper,3,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(D,B))),equivalent(equivalent(D,C),A))).
% 21.35/21.54 7 [hyper,4,1,3] {+} is_a_theorem(equivalent(equivalent(A,B),equivalent(A,B))).
% 21.35/21.54 8 [hyper,7,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(B,C),A))).
% 21.35/21.54 10 [hyper,8,1,4] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,C),equivalent(C,B)))).
% 21.35/21.54 12 [hyper,8,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(C,equivalent(equivalent(D,B),equivalent(A,D))))).
% 21.35/21.54 13 [hyper,8,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,A)),equivalent(C,B))).
% 21.35/21.54 37 [hyper,13,1,10] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),A),B)).
% 21.35/21.54 97 [hyper,12,1,37] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(C,A),B)))).
% 21.35/21.54 98 [binary,97.1,2.1] {+} $F.
% 21.35/21.54
% 21.35/21.54 % SZS output end Refutation
% 21.35/21.54 ------------ end of proof -------------
% 21.35/21.54
% 21.35/21.54
% 21.35/21.54 Search stopped by max_proofs option.
% 21.35/21.54
% 21.35/21.54
% 21.35/21.54 Search stopped by max_proofs option.
% 21.35/21.54
% 21.35/21.54 ============ end of search ============
% 21.35/21.54
% 21.35/21.54 ----------- soft-scott stats ----------
% 21.35/21.54
% 21.35/21.54 true clauses given 1 (6.2%)
% 21.35/21.54 false clauses given 15
% 21.35/21.54
% 21.35/21.54 FALSE TRUE
% 21.35/21.54 8 1 2
% 21.35/21.54 12 16 4
% 21.35/21.54 16 19 0
% 21.35/21.54 20 14 0
% 21.35/21.54 24 6 0
% 21.35/21.54 28 1 0
% 21.35/21.54 tot: 57 6 (9.5% true)
% 21.35/21.54
% 21.35/21.54
% 21.35/21.54 Model 5 [ 3 0 678 ] (0.00 seconds, 214928 Inserts)
% 21.35/21.54
% 21.35/21.54 That finishes the proof of the theorem.
% 21.35/21.54
% 21.35/21.54 Process 14981 finished Sat Jul 2 16:43:51 2022
%------------------------------------------------------------------------------