TSTP Solution File: LCL199-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL199-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n008.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:35 EDT 2022
% Result : Unsatisfiable 0.68s 0.87s
% Output : Refutation 0.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL199-1 : TPTP v8.1.0. Released v1.1.0.
% 0.08/0.14 % Command : sos-script %s
% 0.14/0.35 % Computer : n008.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 : Sat Jul 2 21:59:23 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.37 ----- Otter 3.2, August 2001 -----
% 0.14/0.37 The process was started by sandbox on n008.cluster.edu,
% 0.14/0.37 Sat Jul 2 21:59:23 2022
% 0.14/0.37 The command was "./sos". The process ID is 1489.
% 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.20/0.41
% 0.20/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.41
% 0.20/0.41 Stopped by limit on number of solutions
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 -------------- Softie stats --------------
% 0.20/0.41
% 0.20/0.41 UPDATE_STOP: 300
% 0.20/0.41 SFINDER_TIME_LIMIT: 2
% 0.20/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.41 number of clauses in intial UL: 4
% 0.20/0.41 number of clauses initially in problem: 9
% 0.20/0.41 percentage of clauses intially in UL: 44
% 0.20/0.41 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.41 percent of all initial clauses that are short: 100
% 0.20/0.41 absolute distinct symbol count: 6
% 0.20/0.41 distinct predicate count: 2
% 0.20/0.41 distinct function count: 2
% 0.20/0.41 distinct constant count: 2
% 0.20/0.41
% 0.20/0.41 ---------- no more Softie stats ----------
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.41
% 0.20/0.41 Stopped by limit on number of solutions
% 0.20/0.41
% 0.20/0.41 =========== start of search ===========
% 0.68/0.87
% 0.68/0.87 -------- PROOF --------
% 0.68/0.87 % SZS status Unsatisfiable
% 0.68/0.87 % SZS output start Refutation
% 0.68/0.87
% 0.68/0.87 Model 3 (0.00 seconds, 0 Inserts)
% 0.68/0.87
% 0.68/0.87 Stopped by limit on number of solutions
% 0.68/0.87
% 0.68/0.87 Model 4 (0.00 seconds, 0 Inserts)
% 0.68/0.87
% 0.68/0.87 Stopped by limit on number of solutions
% 0.68/0.87
% 0.68/0.87 Stopped by limit on insertions
% 0.68/0.87
% 0.68/0.87 Model 5 [ 1 28 196360 ] (0.00 seconds, 250000 Inserts)
% 0.68/0.87
% 0.68/0.87 ----> UNIT CONFLICT at 0.47 sec ----> 81 [binary,80.1,4.1] {-} $F.
% 0.68/0.87
% 0.68/0.87 Length of proof is 6. Level of proof is 6.
% 0.68/0.87
% 0.68/0.87 ---------------- PROOF ----------------
% 0.68/0.87 % SZS status Unsatisfiable
% 0.68/0.87 % SZS output start Refutation
% 0.68/0.87
% 0.68/0.87 1 [] {+} theorem(A)| -axiom(A).
% 0.68/0.87 2 [] {+} theorem(A)| -axiom(or(not(B),A))| -theorem(B).
% 0.68/0.87 3 [] {+} theorem(or(not(A),B))| -axiom(or(not(A),C))| -theorem(or(not(C),B)).
% 0.68/0.87 4 [] {+} -theorem(or(not(not(or(p,q))),not(p))).
% 0.68/0.87 5 [] {+} axiom(or(not(or(A,A)),A)).
% 0.68/0.87 6 [] {+} axiom(or(not(A),or(B,A))).
% 0.68/0.87 7 [] {-} axiom(or(not(or(A,B)),or(B,A))).
% 0.68/0.87 10 [hyper,5,1] {+} theorem(or(not(or(A,A)),A)).
% 0.68/0.87 35 [hyper,10,3,6] {+} theorem(or(not(A),A)).
% 0.68/0.87 42 [hyper,35,2,7] {+} theorem(or(A,not(A))).
% 0.68/0.87 54 [hyper,42,3,7] {-} theorem(or(not(or(A,B)),not(not(or(B,A))))).
% 0.68/0.87 69 [hyper,54,3,6] {-} theorem(or(not(A),not(not(or(A,B))))).
% 0.68/0.87 80 [hyper,69,2,7] {-} theorem(or(not(not(or(A,B))),not(A))).
% 0.68/0.87 81 [binary,80.1,4.1] {-} $F.
% 0.68/0.87
% 0.68/0.87 % SZS output end Refutation
% 0.68/0.87 ------------ end of proof -------------
% 0.68/0.87
% 0.68/0.87
% 0.68/0.87 Search stopped by max_proofs option.
% 0.68/0.87
% 0.68/0.87
% 0.68/0.87 Search stopped by max_proofs option.
% 0.68/0.87
% 0.68/0.87 ============ end of search ============
% 0.68/0.87
% 0.68/0.87 ----------- soft-scott stats ----------
% 0.68/0.87
% 0.68/0.87 true clauses given 5 (33.3%)
% 0.68/0.87 false clauses given 10
% 0.68/0.87
% 0.68/0.87 FALSE TRUE
% 0.68/0.87 7 0 5
% 0.68/0.87 9 0 14
% 0.68/0.87 11 1 10
% 0.68/0.87 13 2 7
% 0.68/0.87 15 4 4
% 0.68/0.87 17 2 3
% 0.68/0.87 19 0 1
% 0.68/0.87 tot: 9 44 (83.0% true)
% 0.68/0.87
% 0.68/0.87
% 0.68/0.87 Model 5 [ 1 28 196360 ] (0.00 seconds, 250000 Inserts)
% 0.68/0.87
% 0.68/0.87 That finishes the proof of the theorem.
% 0.68/0.87
% 0.68/0.87 Process 1489 finished Sat Jul 2 21:59:23 2022
%------------------------------------------------------------------------------