TSTP Solution File: LCL003-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL003-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n004.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:18 EDT 2022
% Result : Unsatisfiable 21.31s 21.49s
% Output : Refutation 21.31s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL003-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n004.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 3 02:15:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n004.cluster.edu,
% 0.12/0.35 Sun Jul 3 02:15:38 2022
% 0.12/0.35 The command was "./sos". The process ID is 1910.
% 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.12/0.37
% 0.12/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.37
% 0.12/0.37 Stopped by limit on number of solutions
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 -------------- Softie stats --------------
% 0.12/0.37
% 0.12/0.37 UPDATE_STOP: 300
% 0.12/0.37 SFINDER_TIME_LIMIT: 2
% 0.12/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.37 number of clauses in intial UL: 2
% 0.12/0.37 number of clauses initially in problem: 3
% 0.12/0.37 percentage of clauses intially in UL: 66
% 0.12/0.37 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.37 percent of all initial clauses that are short: 100
% 0.12/0.37 absolute distinct symbol count: 5
% 0.12/0.37 distinct predicate count: 1
% 0.12/0.37 distinct function count: 2
% 0.12/0.37 distinct constant count: 2
% 0.12/0.37
% 0.12/0.37 ---------- no more Softie stats ----------
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 =========== start of search ===========
% 14.34/14.52
% 14.34/14.52
% 14.34/14.52 Changing weight limit from 60 to 50.
% 14.34/14.52
% 14.34/14.52 Model 2 (0.00 seconds, 0 Inserts)
% 14.34/14.52
% 14.34/14.52 Stopped by limit on number of solutions
% 14.34/14.52
% 14.34/14.52 Model 3 (0.00 seconds, 0 Inserts)
% 14.34/14.52
% 14.34/14.52 Stopped by limit on number of solutions
% 14.34/14.52
% 14.34/14.52 Model 4 (0.00 seconds, 0 Inserts)
% 14.34/14.52
% 14.34/14.52 Stopped by limit on number of solutions
% 14.34/14.52
% 14.34/14.52 Modelling stopped after 300 given clauses and 0.00 seconds
% 14.34/14.52
% 14.34/14.52
% 14.34/14.52 Resetting weight limit to 50 after 415 givens.
% 14.34/14.52
% 14.44/14.63
% 14.44/14.63
% 14.44/14.63 Changing weight limit from 50 to 47.
% 14.44/14.63
% 14.44/14.63 Resetting weight limit to 47 after 420 givens.
% 14.44/14.63
% 14.61/14.81
% 14.61/14.81
% 14.61/14.81 Changing weight limit from 47 to 46.
% 14.61/14.81
% 14.61/14.81 Resetting weight limit to 46 after 425 givens.
% 14.61/14.81
% 14.73/14.93
% 14.73/14.93
% 14.73/14.93 Changing weight limit from 46 to 45.
% 14.73/14.93
% 14.73/14.93 Resetting weight limit to 45 after 430 givens.
% 14.73/14.93
% 16.26/16.44
% 16.26/16.44
% 16.26/16.44 Changing weight limit from 45 to 37.
% 16.26/16.44
% 16.26/16.44 Resetting weight limit to 37 after 435 givens.
% 16.26/16.44
% 17.75/17.98
% 17.75/17.98
% 17.75/17.98 Changing weight limit from 37 to 32.
% 17.75/17.98
% 17.75/17.98 Resetting weight limit to 32 after 440 givens.
% 17.75/17.98
% 18.89/19.07
% 18.89/19.07
% 18.89/19.07 Changing weight limit from 32 to 30.
% 18.89/19.07
% 18.89/19.07 Resetting weight limit to 30 after 445 givens.
% 18.89/19.07
% 19.25/19.44
% 19.25/19.44
% 19.25/19.44 Changing weight limit from 30 to 29.
% 19.25/19.44
% 19.25/19.44 Resetting weight limit to 29 after 450 givens.
% 19.25/19.44
% 19.57/19.74
% 19.57/19.74
% 19.57/19.74 Changing weight limit from 29 to 28.
% 19.57/19.74
% 19.57/19.74 Resetting weight limit to 28 after 460 givens.
% 19.57/19.74
% 19.65/19.85
% 19.65/19.85
% 19.65/19.85 Changing weight limit from 28 to 27.
% 19.65/19.85
% 19.65/19.85 Resetting weight limit to 27 after 470 givens.
% 19.65/19.85
% 20.42/20.60
% 20.42/20.60
% 20.42/20.60 Changing weight limit from 27 to 25.
% 20.42/20.60
% 20.42/20.60 Resetting weight limit to 25 after 510 givens.
% 20.42/20.60
% 20.75/20.93
% 20.75/20.93
% 20.75/20.93 Changing weight limit from 25 to 24.
% 20.75/20.93
% 20.75/20.93 Resetting weight limit to 24 after 520 givens.
% 20.75/20.93
% 20.75/21.01
% 20.75/21.01
% 20.75/21.01 Changing weight limit from 24 to 23.
% 20.75/21.01
% 20.75/21.01 Resetting weight limit to 23 after 530 givens.
% 20.75/21.01
% 21.31/21.49
% 21.31/21.49 -- HEY sandbox, WE HAVE A PROOF!! --
% 21.31/21.49
% 21.31/21.49 ----> UNIT CONFLICT at 21.05 sec ----> 16988 [binary,16987.1,2.1] {+} $F.
% 21.31/21.49
% 21.31/21.49 Length of proof is 45. Level of proof is 40.
% 21.31/21.49
% 21.31/21.49 ---------------- PROOF ----------------
% 21.31/21.49 % SZS status Unsatisfiable
% 21.31/21.49 % SZS output start Refutation
% 21.31/21.49
% 21.31/21.49 1 [] {+} -is_a_theorem(or(not(A),B))| -is_a_theorem(A)|is_a_theorem(B).
% 21.31/21.49 2 [] {+} -is_a_theorem(or(not(or(a,b)),or(b,a))).
% 21.31/21.49 3 [] {-} is_a_theorem(or(not(or(not(or(not(A),B)),or(C,or(D,E)))),or(not(or(not(D),A)),or(C,or(E,A))))).
% 21.31/21.49 4 [hyper,3,1,3] {-} is_a_theorem(or(not(or(not(A),or(not(B),C))),or(not(or(not(D),B)),or(or(E,B),or(not(B),C))))).
% 21.31/21.49 6 [hyper,4,1,3] {-} is_a_theorem(or(not(or(not(or(A,B)),C)),or(not(or(not(D),B)),or(or(not(B),E),C)))).
% 21.31/21.49 10 [hyper,6,1,3] {-} is_a_theorem(or(not(or(not(or(not(A),B)),or(C,A))),or(not(or(not(D),A)),or(E,or(C,A))))).
% 21.31/21.49 13 [hyper,10,1,10] {-} is_a_theorem(or(not(or(not(A),or(not(B),or(C,B)))),or(D,or(not(or(not(E),B)),or(not(B),or(C,B)))))).
% 21.31/21.49 64 [hyper,13,1,3] {-} is_a_theorem(or(not(or(not(not(or(not(A),B))),C)),or(D,or(or(not(B),or(E,B)),C)))).
% 21.31/21.49 78 [hyper,64,1,13] {-} is_a_theorem(or(A,or(not(or(not(B),C)),or(not(C),or(or(not(D),or(E,D)),C))))).
% 21.31/21.49 85 [hyper,78,1,78] {-} is_a_theorem(or(not(or(not(A),B)),or(not(B),or(or(not(C),or(D,C)),B)))).
% 21.31/21.49 94 [hyper,85,1,3] {-} is_a_theorem(or(not(or(not(or(not(A),or(B,A))),C)),or(not(D),or(D,C)))).
% 21.31/21.49 109 [hyper,94,1,13] {-} is_a_theorem(or(A,or(not(or(not(B),C)),or(not(C),or(C,C))))).
% 21.31/21.49 146 [hyper,109,1,109] {-} is_a_theorem(or(not(or(not(A),B)),or(not(B),or(B,B)))).
% 21.31/21.49 156 [hyper,146,1,3] {-} is_a_theorem(or(not(or(not(A),B)),or(not(A),or(A,B)))).
% 21.31/21.49 168 [hyper,156,1,3] {-} is_a_theorem(or(not(or(not(A),A)),or(not(A),or(B,A)))).
% 21.31/21.49 183 [hyper,168,1,13] {-} is_a_theorem(or(A,or(not(or(not(B),C)),or(not(C),or(D,C))))).
% 21.31/21.49 243 [hyper,183,1,183] {-} is_a_theorem(or(not(or(not(A),B)),or(not(B),or(C,B)))).
% 21.31/21.49 255 [hyper,243,1,10] {-} is_a_theorem(or(not(or(not(A),or(B,C))),or(D,or(not(C),or(B,C))))).
% 21.31/21.49 256 [hyper,243,1,3] {-} is_a_theorem(or(not(or(not(A),B)),or(not(C),or(C,B)))).
% 21.31/21.49 275 [hyper,256,1,3] {-} is_a_theorem(or(not(or(not(A),B)),or(not(A),or(C,B)))).
% 21.31/21.49 391 [hyper,275,1,10] {+} is_a_theorem(or(not(or(not(A),or(B,C))),or(D,or(not(or(B,C)),or(B,C))))).
% 21.31/21.49 401 [hyper,275,1,243] {-} is_a_theorem(or(not(or(not(A),B)),or(C,or(not(B),or(D,B))))).
% 21.31/21.49 573 [hyper,401,1,3] {-} is_a_theorem(or(not(or(not(not(A)),B)),or(C,or(or(D,A),B)))).
% 21.31/21.49 670 [hyper,573,1,3] {-} is_a_theorem(or(not(or(not(or(A,B)),not(B))),or(C,or(D,not(B))))).
% 21.31/21.49 1912 [hyper,255,1,670] {-} is_a_theorem(or(A,or(not(or(B,not(C))),or(D,or(B,not(C)))))).
% 21.31/21.49 2116 [hyper,1912,1,1912] {-} is_a_theorem(or(not(or(A,not(B))),or(C,or(A,not(B))))).
% 21.31/21.49 2170 [hyper,2116,1,3] {-} is_a_theorem(or(not(or(not(not(A)),A)),or(B,or(not(C),A)))).
% 21.31/21.49 2193 [hyper,2170,1,255] {-} is_a_theorem(or(A,or(not(or(not(B),C)),or(D,or(not(B),C))))).
% 21.31/21.49 2587 [hyper,2193,1,2193] {-} is_a_theorem(or(not(or(not(A),B)),or(C,or(not(A),B)))).
% 21.31/21.49 2624 [hyper,2587,1,3] {-} is_a_theorem(or(not(or(not(not(A)),A)),or(B,or(C,A)))).
% 21.31/21.49 2672 [hyper,2624,1,255] {-} is_a_theorem(or(A,or(not(or(B,C)),or(D,or(B,C))))).
% 21.31/21.49 2779 [hyper,2672,1,2672] {-} is_a_theorem(or(not(or(A,B)),or(C,or(A,B)))).
% 21.31/21.49 2789 [hyper,2779,1,275] {-} is_a_theorem(or(not(or(A,B)),or(C,or(D,or(A,B))))).
% 21.31/21.49 2865 [hyper,2789,1,3] {-} is_a_theorem(or(not(or(not(A),B)),or(C,or(or(not(B),D),B)))).
% 21.31/21.49 3115 [hyper,2865,1,3] {-} is_a_theorem(or(not(or(not(or(not(A),B)),C)),or(D,or(A,C)))).
% 21.31/21.49 3148 [hyper,3115,1,243] {-} is_a_theorem(or(A,or(B,or(not(C),or(D,C))))).
% 21.31/21.49 3764 [hyper,3148,1,3148] {-} is_a_theorem(or(A,or(not(B),or(C,B)))).
% 21.31/21.49 3774 [hyper,3764,1,3764] {+} is_a_theorem(or(not(A),or(B,A))).
% 21.31/21.49 3970 [hyper,391,1,3774] {+} is_a_theorem(or(A,or(not(or(B,C)),or(B,C)))).
% 21.31/21.49 13010 [hyper,3970,1,3] {-} is_a_theorem(or(not(or(not(A),B)),or(not(or(A,C)),or(C,B)))).
% 21.31/21.49 13038 [hyper,13010,1,3115] {-} is_a_theorem(or(A,or(B,or(not(or(B,C)),or(C,D))))).
% 21.31/21.49 13049 [hyper,13010,1,3] {-} is_a_theorem(or(not(or(not(A),B)),or(not(or(B,A)),or(C,B)))).
% 21.31/21.49 13080 [hyper,13010,1,3774] {-} is_a_theorem(or(not(or(A,B)),or(B,or(C,A)))).
% 21.31/21.49 13625 [hyper,13038,1,13038] {-} is_a_theorem(or(A,or(not(or(A,B)),or(B,C)))).
% 21.31/21.49 13656 [hyper,13625,1,13080] {-} is_a_theorem(or(or(not(or(A,B)),or(B,C)),or(D,A))).
% 21.31/21.49 16542 [hyper,13049,1,3774] {-} is_a_theorem(or(not(or(or(A,B),B)),or(C,or(A,B)))).
% 21.31/21.49 16901 [hyper,16542,1,13656] {-} is_a_theorem(or(A,or(not(or(B,C)),or(C,B)))).
% 21.31/21.49 16987 [hyper,16901,1,16901] {-} is_a_theorem(or(not(or(A,B)),or(B,A))).
% 21.31/21.49 16988 [binary,16987.1,2.1] {+} $F.
% 21.31/21.49
% 21.31/21.49 % SZS output end Refutation
% 21.31/21.49 ------------ end of proof -------------
% 21.31/21.49
% 21.31/21.49
% 21.31/21.49 Search stopped by max_proofs option.
% 21.31/21.49
% 21.31/21.49
% 21.31/21.49 Search stopped by max_proofs option.
% 21.31/21.49
% 21.31/21.49 ============ end of search ============
% 21.31/21.49
% 21.31/21.49 ----------- soft-scott stats ----------
% 21.31/21.49
% 21.31/21.49 true clauses given 172 (29.3%)
% 21.31/21.49 false clauses given 415
% 21.31/21.49
% 21.31/21.49 FALSE TRUE
% 21.31/21.49 5 0 1
% 21.31/21.49 9 0 7
% 21.31/21.49 11 1 146
% 21.31/21.49 13 7 419
% 21.31/21.49 15 273 454
% 21.31/21.49 16 0 1
% 21.31/21.49 17 591 440
% 21.31/21.49 18 0 14
% 21.31/21.49 19 898 346
% 21.31/21.49 20 2 41
% 21.31/21.49 21 729 500
% 21.31/21.49 22 0 65
% 21.31/21.49 23 1 83
% 21.31/21.49 tot: 2502 2517 (50.1% true)
% 21.31/21.49
% 21.31/21.49
% 21.31/21.49 Model 4 (0.00 seconds, 0 Inserts)
% 21.31/21.49
% 21.31/21.49 That finishes the proof of the theorem.
% 21.31/21.49
% 21.31/21.49 Process 1910 finished Sun Jul 3 02:15:59 2022
%------------------------------------------------------------------------------