TSTP Solution File: FLD033-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : FLD033-3 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n025.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 : Sat Jul 16 02:27:44 EDT 2022
% Result : Unsatisfiable 2.64s 2.81s
% Output : Refutation 2.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : FLD033-3 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.06/0.13 % Command : sos-script %s
% 0.12/0.33 % Computer : n025.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 7 02:45:18 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n025.cluster.edu,
% 0.12/0.35 Tue Jun 7 02:45:18 2022
% 0.12/0.35 The command was "./sos". The process ID is 15085.
% 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=0, equality=0, symmetry=0, max_lits=5.
% 0.12/0.35
% 0.12/0.35 This is a non-Horn set without equality. The strategy
% 0.12/0.35 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.35 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35 dependent: set(unit_deletion).
% 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.19/0.44
% 0.19/0.44 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.44
% 0.19/0.44 Stopped by limit on number of solutions
% 0.19/0.44
% 0.19/0.44
% 0.19/0.44 -------------- Softie stats --------------
% 0.19/0.44
% 0.19/0.44 UPDATE_STOP: 300
% 0.19/0.44 SFINDER_TIME_LIMIT: 2
% 0.19/0.44 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.44 number of clauses in intial UL: 49
% 0.19/0.44 number of clauses initially in problem: 54
% 0.19/0.44 percentage of clauses intially in UL: 90
% 0.19/0.44 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.44 percent of all initial clauses that are short: 100
% 0.19/0.44 absolute distinct symbol count: 12
% 0.19/0.44 distinct predicate count: 4
% 0.19/0.44 distinct function count: 4
% 0.19/0.44 distinct constant count: 4
% 0.19/0.44
% 0.19/0.44 ---------- no more Softie stats ----------
% 0.19/0.44
% 0.19/0.44
% 0.19/0.44
% 0.19/0.44 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.44
% 0.19/0.44 Stopped by limit on number of solutions
% 0.19/0.44
% 0.19/0.44 =========== start of search ===========
% 2.64/2.81
% 2.64/2.81 -------- PROOF --------
% 2.64/2.81 % SZS status Unsatisfiable
% 2.64/2.81 % SZS output start Refutation
% 2.64/2.81
% 2.64/2.81 Stopped by limit on insertions
% 2.64/2.81
% 2.64/2.81 Model 3 [ 2 1 227 ] (0.00 seconds, 250000 Inserts)
% 2.64/2.81
% 2.64/2.81 Stopped by limit on insertions
% 2.64/2.81
% 2.64/2.81 Model 4 [ 2 1 319 ] (0.00 seconds, 250000 Inserts)
% 2.64/2.81
% 2.64/2.81 Stopped by limit on insertions
% 2.64/2.81
% 2.64/2.81 Model 5 [ 3 1 817 ] (0.00 seconds, 250000 Inserts)
% 2.64/2.81
% 2.64/2.81 Stopped by limit on insertions
% 2.64/2.81
% 2.64/2.81 Model 6 [ 3 2 402 ] (0.00 seconds, 250000 Inserts)
% 2.64/2.81
% 2.64/2.81 Stopped by limit on insertions
% 2.64/2.81
% 2.64/2.81 Model 7 [ 3 1 324 ] (0.00 seconds, 250000 Inserts)
% 2.64/2.81
% 2.64/2.81 Stopped by limit on insertions
% 2.64/2.81
% 2.64/2.81 Model 8 [ 3 1 145 ] (0.00 seconds, 250000 Inserts)
% 2.64/2.81
% 2.64/2.81 Stopped by limit on insertions
% 2.64/2.81
% 2.64/2.81 Model 9 [ 3 1 1111 ] (0.00 seconds, 250000 Inserts)
% 2.64/2.81
% 2.64/2.81 Stopped by limit on insertions
% 2.64/2.81
% 2.64/2.81 Model 10 [ 6 4 127062 ] (0.00 seconds, 250000 Inserts)
% 2.64/2.81
% 2.64/2.81 Stopped by limit on insertions
% 2.64/2.81
% 2.64/2.81 Model 11 [ 10 1 187 ] (0.00 seconds, 250000 Inserts)
% 2.64/2.81
% 2.64/2.81 Stopped by limit on insertions
% 2.64/2.81
% 2.64/2.81 Model 12 [ 3 1 566 ] (0.00 seconds, 250000 Inserts)
% 2.64/2.81
% 2.64/2.81 Stopped by limit on insertions
% 2.64/2.81
% 2.64/2.81 Model 13 [ 6 3 68797 ] (0.00 seconds, 250000 Inserts)
% 2.64/2.81
% 2.64/2.81 Stopped by limit on insertions
% 2.64/2.81
% 2.64/2.81 Model 14 [ 4 2 495 ] (0.00 seconds, 250000 Inserts)
% 2.64/2.81
% 2.64/2.81 Stopped by limit on insertions
% 2.64/2.81
% 2.64/2.81 Model 15 [ 6 4 72126 ] (0.00 seconds, 250000 Inserts)
% 2.64/2.81
% 2.64/2.81 Stopped by limit on insertions
% 2.64/2.81
% 2.64/2.81 Model 16 [ 16 1 190 ] (0.00 seconds, 250000 Inserts)
% 2.64/2.81
% 2.64/2.81 Stopped by limit on insertions
% 2.64/2.81
% 2.64/2.81 Model 17 [ 15 1 111 ] (0.00 seconds, 250000 Inserts)
% 2.64/2.81
% 2.64/2.81 Stopped by limit on insertions
% 2.64/2.81
% 2.64/2.81 Model 18 [ 4 8 232321 ] (0.00 seconds, 250000 Inserts)
% 2.64/2.81
% 2.64/2.81 Stopped by limit on insertions
% 2.64/2.81
% 2.64/2.81 Model 19 [ 16 1 105 ] (0.00 seconds, 250000 Inserts)
% 2.64/2.81
% 2.64/2.81 Stopped by limit on insertions
% 2.64/2.81
% 2.64/2.81 Model 20 [ 6 2 47747 ] (0.00 seconds, 250000 Inserts)
% 2.64/2.81
% 2.64/2.81 Stopped by limit on insertions
% 2.64/2.81
% 2.64/2.81 Model 21 [ 18 1 111 ] (0.00 seconds, 250000 Inserts)
% 2.64/2.81
% 2.64/2.81 Stopped by limit on insertions
% 2.64/2.81
% 2.64/2.81 Model 22 [ 4 3 49858 ] (0.00 seconds, 250000 Inserts)
% 2.64/2.81
% 2.64/2.81 Stopped by limit on insertions
% 2.64/2.81
% 2.64/2.81 Model 23 [ 20 2 145 ] (0.00 seconds, 250000 Inserts)
% 2.64/2.81
% 2.64/2.81 Stopped by limit on insertions
% 2.64/2.81
% 2.64/2.81 Model 24 [ 5 2 300 ] (0.00 seconds, 250000 Inserts)
% 2.64/2.81
% 2.64/2.81 Stopped by limit on insertions
% 2.64/2.81
% 2.64/2.81 Model 25 [ 6 2 28204 ] (0.00 seconds, 250000 Inserts)
% 2.64/2.81
% 2.64/2.81 ----> UNIT CONFLICT at 2.42 sec ----> 1649 [binary,1648.1,26.1] {-} $F.
% 2.64/2.81
% 2.64/2.81 Length of proof is 4. Level of proof is 2.
% 2.64/2.81
% 2.64/2.81 ---------------- PROOF ----------------
% 2.64/2.81 % SZS status Unsatisfiable
% 2.64/2.81 % SZS output start Refutation
% 2.64/2.81
% 2.64/2.81 7 [] {+} product(A,B,C)| -product(D,E,A)| -product(E,B,F)| -product(D,F,C).
% 2.64/2.81 9 [] {+} product(multiplicative_inverse(A),A,multiplicative_identity)|sum(additive_identity,A,additive_identity)| -defined(A).
% 2.64/2.81 10 [] {+} product(A,B,C)| -product(B,A,C).
% 2.64/2.81 25 [] {+} -sum(additive_identity,a,additive_identity).
% 2.64/2.81 26 [] {+} -product(multiplicative_identity,m,multiplicative_identity).
% 2.64/2.81 33 [factor,7.2.4] {+} product(A,B,A)| -product(C,D,A)| -product(D,B,D).
% 2.64/2.81 52 [] {-} defined(a).
% 2.64/2.81 54 [] {+} product(m,a,a).
% 2.64/2.81 111 [hyper,52,9,unit_del,25] {+} product(multiplicative_inverse(a),a,multiplicative_identity).
% 2.64/2.81 153 [hyper,54,10] {+} product(a,m,a).
% 2.64/2.81 1648 [hyper,111,33,153] {-} product(multiplicative_identity,m,multiplicative_identity).
% 2.64/2.81 1649 [binary,1648.1,26.1] {-} $F.
% 2.64/2.81
% 2.64/2.81 % SZS output end Refutation
% 2.64/2.81 ------------ end of proof -------------
% 2.64/2.81
% 2.64/2.81
% 2.64/2.81 Search stopped by max_proofs option.
% 2.64/2.81
% 2.64/2.81
% 2.64/2.81 Search stopped by max_proofs option.
% 2.64/2.81
% 2.64/2.81 ============ end of search ============
% 2.64/2.81
% 2.64/2.81 ----------- soft-scott stats ----------
% 2.64/2.81
% 2.64/2.81 true clauses given 8 (23.5%)
% 2.64/2.81 false clauses given 26
% 2.64/2.81
% 2.64/2.81 FALSE TRUE
% 2.64/2.81 4 8 26
% 2.64/2.81 5 25 77
% 2.64/2.81 6 52 192
% 2.64/2.81 7 38 160
% 2.64/2.81 8 44 237
% 2.64/2.81 9 3 13
% 2.64/2.81 10 80 159
% 2.64/2.81 11 0 8
% 2.64/2.81 12 54 175
% 2.64/2.81 14 0 198
% 2.64/2.81 15 0 8
% 2.64/2.81 tot: 304 1253 (80.5% true)
% 2.64/2.81
% 2.64/2.81
% 2.64/2.81 Model 25 [ 6 2 28204 ] (0.00 seconds, 250000 Inserts)
% 2.64/2.81
% 2.64/2.81 That finishes the proof of the theorem.
% 2.64/2.81
% 2.64/2.81 Process 15085 finished Tue Jun 7 02:45:21 2022
%------------------------------------------------------------------------------