TSTP Solution File: ALG002-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : ALG002-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n024.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 : Thu Jul 14 18:00:50 EDT 2022
% Result : Unsatisfiable 0.20s 0.56s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : ALG002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Wed Jun 8 11:20:34 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.37 ----- Otter 3.2, August 2001 -----
% 0.13/0.37 The process was started by sandbox on n024.cluster.edu,
% 0.13/0.37 Wed Jun 8 11:20:34 2022
% 0.13/0.37 The command was "./sos". The process ID is 18375.
% 0.13/0.37
% 0.13/0.37 set(prolog_style_variables).
% 0.13/0.37 set(auto).
% 0.13/0.37 dependent: set(auto1).
% 0.13/0.37 dependent: set(process_input).
% 0.13/0.37 dependent: clear(print_kept).
% 0.13/0.37 dependent: clear(print_new_demod).
% 0.13/0.37 dependent: clear(print_back_demod).
% 0.13/0.37 dependent: clear(print_back_sub).
% 0.13/0.37 dependent: set(control_memory).
% 0.13/0.37 dependent: assign(max_mem, 12000).
% 0.13/0.37 dependent: assign(pick_given_ratio, 4).
% 0.13/0.37 dependent: assign(stats_level, 1).
% 0.13/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37 dependent: assign(sos_limit, 5000).
% 0.13/0.37 dependent: assign(max_weight, 60).
% 0.13/0.37 clear(print_given).
% 0.13/0.37
% 0.13/0.37 list(usable).
% 0.13/0.37
% 0.13/0.37 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 0.13/0.37
% 0.13/0.37 This is a non-Horn set without equality. The strategy
% 0.13/0.37 will be ordered hyper_res, ur_res, unit deletion, and
% 0.13/0.37 factoring, with satellites in sos and nuclei in usable.
% 0.13/0.37
% 0.13/0.37 dependent: set(hyper_res).
% 0.13/0.37 dependent: set(factor).
% 0.13/0.37 dependent: set(unit_deletion).
% 0.13/0.37
% 0.13/0.37 ------------> process usable:
% 0.13/0.37
% 0.13/0.37 ------------> process sos:
% 0.13/0.37
% 0.13/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: 12
% 0.20/0.41 number of clauses initially in problem: 16
% 0.20/0.41 percentage of clauses intially in UL: 75
% 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: 7
% 0.20/0.41 distinct predicate count: 2
% 0.20/0.41 distinct function count: 2
% 0.20/0.41 distinct constant count: 3
% 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.20/0.56
% 0.20/0.56 -------- PROOF --------
% 0.20/0.56 % SZS status Unsatisfiable
% 0.20/0.56 % SZS output start Refutation
% 0.20/0.56
% 0.20/0.56 Model 3 (0.00 seconds, 0 Inserts)
% 0.20/0.56
% 0.20/0.56 Stopped by limit on number of solutions
% 0.20/0.56
% 0.20/0.56 Model 4 (0.00 seconds, 0 Inserts)
% 0.20/0.56
% 0.20/0.56 Stopped by limit on number of solutions
% 0.20/0.56
% 0.20/0.56 Model 5 [ 2 1 1497 ] (0.00 seconds, 34364 Inserts)
% 0.20/0.56
% 0.20/0.56 ----> UNIT CONFLICT at 0.17 sec ----> 464 [binary,463.1,1.1] {-} $F.
% 0.20/0.56
% 0.20/0.56 Length of proof is 9. Level of proof is 5.
% 0.20/0.56
% 0.20/0.56 ---------------- PROOF ----------------
% 0.20/0.56 % SZS status Unsatisfiable
% 0.20/0.56 % SZS output start Refutation
% 0.20/0.56
% 0.20/0.56 1 [] {+} -product(multiplicative_identity,multiplicative_identity,additive_identity).
% 0.20/0.56 2 [] {+} -product(A,B,C)|product(additive_inverse(A),additive_inverse(B),C).
% 0.20/0.56 4 [] {+} -product(A,B,C)|product(A,additive_inverse(B),additive_inverse(C)).
% 0.20/0.56 6 [] {+} -greater_than_0(A)| -product(A,A,additive_identity).
% 0.20/0.56 7 [] {+} -product(A,B,C)|product(B,A,C).
% 0.20/0.56 8 [] {+} -product(A,B,C)| -product(A,A,additive_identity)|product(C,C,additive_identity).
% 0.20/0.56 9 [] {+} -product(A,B,C)| -greater_than_0(A)| -greater_than_0(B)|greater_than_0(C).
% 0.20/0.56 10 [] {+} -greater_than_0(multiplicative_inverse(a)).
% 0.20/0.56 13 [] {+} product(A,multiplicative_identity,A).
% 0.20/0.56 14 [] {-} product(A,multiplicative_inverse(A),multiplicative_identity)|product(A,A,additive_identity).
% 0.20/0.56 15 [] {-} greater_than_0(A)|product(A,A,additive_identity)|greater_than_0(additive_inverse(A)).
% 0.20/0.56 16 [] {+} greater_than_0(a).
% 0.20/0.56 19 [hyper,13,2] {+} product(additive_inverse(A),additive_inverse(multiplicative_identity),A).
% 0.20/0.56 21 [hyper,14,4] {+} product(A,A,additive_identity)|product(A,additive_inverse(multiplicative_inverse(A)),additive_inverse(multiplicative_identity)).
% 0.20/0.56 25 [hyper,14,6,16] {+} product(a,multiplicative_inverse(a),multiplicative_identity).
% 0.20/0.56 30 [hyper,25,7] {+} product(multiplicative_inverse(a),a,multiplicative_identity).
% 0.20/0.56 35 [hyper,15,10] {-} product(multiplicative_inverse(a),multiplicative_inverse(a),additive_identity)|greater_than_0(additive_inverse(multiplicative_inverse(a))).
% 0.20/0.56 200 [hyper,21,9,16,35] {-} product(a,a,additive_identity)|greater_than_0(additive_inverse(multiplicative_identity))|product(multiplicative_inverse(a),multiplicative_inverse(a),additive_identity).
% 0.20/0.56 447 [hyper,200,9,19,35,unit_del,10,factor_simp] {-} product(a,a,additive_identity)|product(multiplicative_inverse(a),multiplicative_inverse(a),additive_identity).
% 0.20/0.56 454 [hyper,447,8,30,unit_del,1] {+} product(a,a,additive_identity).
% 0.20/0.56 463 [hyper,454,8,25] {-} product(multiplicative_identity,multiplicative_identity,additive_identity).
% 0.20/0.56 464 [binary,463.1,1.1] {-} $F.
% 0.20/0.56
% 0.20/0.56 % SZS output end Refutation
% 0.20/0.56 ------------ end of proof -------------
% 0.20/0.56
% 0.20/0.56
% 0.20/0.56 Search stopped by max_proofs option.
% 0.20/0.56
% 0.20/0.56
% 0.20/0.56 Search stopped by max_proofs option.
% 0.20/0.56
% 0.20/0.56 ============ end of search ============
% 0.20/0.56
% 0.20/0.56 ----------- soft-scott stats ----------
% 0.20/0.56
% 0.20/0.56 true clauses given 19 (45.2%)
% 0.20/0.56 false clauses given 23
% 0.20/0.56
% 0.20/0.56 FALSE TRUE
% 0.20/0.56 6 1 1
% 0.20/0.56 7 12 0
% 0.20/0.56 8 1 6
% 0.20/0.56 9 8 1
% 0.20/0.56 11 17 4
% 0.20/0.56 13 22 2
% 0.20/0.56 14 0 1
% 0.20/0.56 15 7 0
% 0.20/0.56 16 2 1
% 0.20/0.56 17 2 2
% 0.20/0.56 18 4 2
% 0.20/0.56 19 4 3
% 0.20/0.56 20 3 2
% 0.20/0.56 21 4 3
% 0.20/0.56 23 2 5
% 0.20/0.56 24 1 0
% 0.20/0.56 25 2 4
% 0.20/0.56 26 1 2
% 0.20/0.56 27 1 6
% 0.20/0.56 28 0 2
% 0.20/0.56 29 2 5
% 0.20/0.56 30 0 2
% 0.20/0.56 31 1 2
% 0.20/0.56 32 0 2
% 0.20/0.56 33 1 2
% 0.20/0.56 34 0 2
% 0.20/0.56 35 1 2
% 0.20/0.56 36 0 1
% 0.20/0.56 37 0 3
% 0.20/0.56 38 0 1
% 0.20/0.56 39 0 4
% 0.20/0.56 40 0 1
% 0.20/0.56 41 0 4
% 0.20/0.56 42 0 1
% 0.20/0.56 43 0 3
% 0.20/0.56 44 0 1
% 0.20/0.56 45 0 3
% 0.20/0.56 47 0 2
% 0.20/0.56 49 0 1
% 0.20/0.56 51 0 1
% 0.20/0.56 52 0 1
% 0.20/0.56 53 0 1
% 0.20/0.56 54 0 1
% 0.20/0.56 55 0 1
% 0.20/0.56 56 0 1
% 0.20/0.56 58 0 1
% 0.20/0.56 60 0 1
% 0.20/0.56 tot: 99 97 (49.5% true)
% 0.20/0.56
% 0.20/0.56
% 0.20/0.56 Model 5 [ 2 1 1497 ] (0.00 seconds, 34364 Inserts)
% 0.20/0.56
% 0.20/0.56 That finishes the proof of the theorem.
% 0.20/0.56
% 0.20/0.56 Process 18375 finished Wed Jun 8 11:20:34 2022
%------------------------------------------------------------------------------