TSTP Solution File: BOO002-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : BOO002-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : 300s
% DateTime : Sat May 4 07:26:57 EDT 2024
% Result : Unsatisfiable 0.78s 0.58s
% Output : CNFRefutation 0.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of clauses : 29 ( 29 unt; 0 nHn; 4 RR)
% Number of literals : 29 ( 28 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-3 aty)
% Number of variables : 78 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2,X3),X4,multiply(X1,X2,X5)) = multiply(X1,X2,multiply(X3,X4,X5)),
file('/export/starexec/sandbox/tmp/tmp.rpjCWCkSZJ/E---3.1_9351.p',associativity) ).
cnf(ternary_multiply_1,axiom,
multiply(X1,X2,X2) = X2,
file('/export/starexec/sandbox/tmp/tmp.rpjCWCkSZJ/E---3.1_9351.p',ternary_multiply_1) ).
cnf(ternary_multiply_2,axiom,
multiply(X1,X1,X2) = X1,
file('/export/starexec/sandbox/tmp/tmp.rpjCWCkSZJ/E---3.1_9351.p',ternary_multiply_2) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1,X2) = X2,
file('/export/starexec/sandbox/tmp/tmp.rpjCWCkSZJ/E---3.1_9351.p',left_inverse) ).
cnf(prove_equation,negated_conjecture,
multiply(a,inverse(a),b) != b,
file('/export/starexec/sandbox/tmp/tmp.rpjCWCkSZJ/E---3.1_9351.p',prove_equation) ).
cnf(c_0_5,axiom,
multiply(multiply(X1,X2,X3),X4,multiply(X1,X2,X5)) = multiply(X1,X2,multiply(X3,X4,X5)),
associativity ).
cnf(c_0_6,axiom,
multiply(X1,X2,X2) = X2,
ternary_multiply_1 ).
cnf(c_0_7,axiom,
multiply(X1,X1,X2) = X1,
ternary_multiply_2 ).
cnf(c_0_8,plain,
multiply(multiply(X1,X2,X3),X4,X2) = multiply(X1,X2,multiply(X3,X4,X2)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
multiply(X1,X2,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_7]),c_0_7]),c_0_7]) ).
cnf(c_0_10,plain,
multiply(X1,X2,multiply(X3,multiply(X1,X2,X3),X4)) = multiply(X1,X2,X3),
inference(spm,[status(thm)],[c_0_7,c_0_5]) ).
cnf(c_0_11,plain,
multiply(X1,X2,multiply(X1,X3,X2)) = multiply(X1,X3,X2),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
multiply(X1,X2,multiply(X3,X1,X4)) = multiply(X3,X1,multiply(X1,X2,X4)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_13,plain,
multiply(X1,X2,multiply(X3,X4,multiply(X1,X2,X3))) = multiply(X1,X2,X3),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
multiply(X1,X2,multiply(X3,X1,X2)) = multiply(X3,X1,X2),
inference(spm,[status(thm)],[c_0_12,c_0_6]) ).
cnf(c_0_15,plain,
multiply(multiply(X1,X2,X3),X4,X1) = multiply(X1,X2,multiply(X3,X4,X1)),
inference(spm,[status(thm)],[c_0_5,c_0_9]) ).
cnf(c_0_16,plain,
multiply(X1,multiply(X2,X3,X1),X2) = multiply(X2,X3,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_10]),c_0_6]) ).
cnf(c_0_17,plain,
multiply(X1,X2,multiply(X3,X4,multiply(X1,X2,X4))) = multiply(X1,X2,X4),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_18,plain,
multiply(X1,multiply(X2,X3,X1),multiply(X2,X4,X1)) = multiply(multiply(X2,X3,X1),X4,X1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,axiom,
multiply(inverse(X1),X1,X2) = X2,
left_inverse ).
cnf(c_0_20,plain,
multiply(X1,multiply(X2,X3,X1),X3) = multiply(X2,X3,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_10]),c_0_6]) ).
cnf(c_0_21,plain,
multiply(multiply(inverse(X1),X2,X3),X1,X3) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_9]) ).
cnf(c_0_22,plain,
multiply(X1,multiply(X2,X1,X3),X3) = multiply(X2,X1,X3),
inference(spm,[status(thm)],[c_0_16,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
multiply(a,inverse(a),b) != b,
inference(fof_simplification,[status(thm)],[prove_equation]) ).
cnf(c_0_24,plain,
multiply(multiply(X1,inverse(X2),X3),X2,X3) = X3,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
multiply(multiply(X1,X2,X3),X1,X3) = multiply(X1,X2,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_7]),c_0_16]) ).
cnf(c_0_26,negated_conjecture,
multiply(a,inverse(a),b) != b,
c_0_23 ).
cnf(c_0_27,plain,
multiply(X1,inverse(X1),X2) = X2,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : BOO002-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n024.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 : 300
% 0.14/0.35 % DateTime : Fri May 3 11:53:20 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.rpjCWCkSZJ/E---3.1_9351.p
% 0.78/0.58 # Version: 3.1.0
% 0.78/0.58 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.78/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.78/0.58 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.78/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.78/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.78/0.58 # Starting sh5l with 300s (1) cores
% 0.78/0.58 # new_bool_3 with pid 9429 completed with status 0
% 0.78/0.58 # Result found by new_bool_3
% 0.78/0.58 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.78/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.78/0.58 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.78/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.78/0.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.78/0.58 # Search class: FUUPM-FFSF32-SFFFFFNN
% 0.78/0.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.78/0.58 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.78/0.58 # SAT001_MinMin_p005000_rr_RG with pid 9434 completed with status 0
% 0.78/0.58 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.78/0.58 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.78/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.78/0.58 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.78/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.78/0.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.78/0.58 # Search class: FUUPM-FFSF32-SFFFFFNN
% 0.78/0.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.78/0.58 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.78/0.58 # Preprocessing time : 0.001 s
% 0.78/0.58 # Presaturation interreduction done
% 0.78/0.58
% 0.78/0.58 # Proof found!
% 0.78/0.58 # SZS status Unsatisfiable
% 0.78/0.58 # SZS output start CNFRefutation
% See solution above
% 0.78/0.58 # Parsed axioms : 5
% 0.78/0.58 # Removed by relevancy pruning/SinE : 0
% 0.78/0.58 # Initial clauses : 5
% 0.78/0.58 # Removed in clause preprocessing : 0
% 0.78/0.58 # Initial clauses in saturation : 5
% 0.78/0.58 # Processed clauses : 128
% 0.78/0.58 # ...of these trivial : 49
% 0.78/0.58 # ...subsumed : 6
% 0.78/0.58 # ...remaining for further processing : 73
% 0.78/0.58 # Other redundant clauses eliminated : 0
% 0.78/0.58 # Clauses deleted for lack of memory : 0
% 0.78/0.58 # Backward-subsumed : 0
% 0.78/0.58 # Backward-rewritten : 5
% 0.78/0.58 # Generated clauses : 7431
% 0.78/0.58 # ...of the previous two non-redundant : 3909
% 0.78/0.58 # ...aggressively subsumed : 0
% 0.78/0.58 # Contextual simplify-reflections : 0
% 0.78/0.58 # Paramodulations : 7431
% 0.78/0.58 # Factorizations : 0
% 0.78/0.58 # NegExts : 0
% 0.78/0.58 # Equation resolutions : 0
% 0.78/0.58 # Disequality decompositions : 0
% 0.78/0.58 # Total rewrite steps : 7001
% 0.78/0.58 # ...of those cached : 4641
% 0.78/0.58 # Propositional unsat checks : 0
% 0.78/0.58 # Propositional check models : 0
% 0.78/0.58 # Propositional check unsatisfiable : 0
% 0.78/0.58 # Propositional clauses : 0
% 0.78/0.58 # Propositional clauses after purity: 0
% 0.78/0.58 # Propositional unsat core size : 0
% 0.78/0.58 # Propositional preprocessing time : 0.000
% 0.78/0.58 # Propositional encoding time : 0.000
% 0.78/0.58 # Propositional solver time : 0.000
% 0.78/0.58 # Success case prop preproc time : 0.000
% 0.78/0.58 # Success case prop encoding time : 0.000
% 0.78/0.58 # Success case prop solver time : 0.000
% 0.78/0.58 # Current number of processed clauses : 63
% 0.78/0.58 # Positive orientable unit clauses : 61
% 0.78/0.58 # Positive unorientable unit clauses: 2
% 0.78/0.58 # Negative unit clauses : 0
% 0.78/0.58 # Non-unit-clauses : 0
% 0.78/0.58 # Current number of unprocessed clauses: 3788
% 0.78/0.58 # ...number of literals in the above : 3788
% 0.78/0.58 # Current number of archived formulas : 0
% 0.78/0.58 # Current number of archived clauses : 10
% 0.78/0.58 # Clause-clause subsumption calls (NU) : 0
% 0.78/0.58 # Rec. Clause-clause subsumption calls : 0
% 0.78/0.58 # Non-unit clause-clause subsumptions : 0
% 0.78/0.58 # Unit Clause-clause subsumption calls : 20
% 0.78/0.58 # Rewrite failures with RHS unbound : 0
% 0.78/0.58 # BW rewrite match attempts : 1569
% 0.78/0.58 # BW rewrite match successes : 10
% 0.78/0.58 # Condensation attempts : 0
% 0.78/0.58 # Condensation successes : 0
% 0.78/0.58 # Termbank termtop insertions : 57397
% 0.78/0.58 # Search garbage collected termcells : 2
% 0.78/0.58
% 0.78/0.58 # -------------------------------------------------
% 0.78/0.58 # User time : 0.081 s
% 0.78/0.58 # System time : 0.005 s
% 0.78/0.58 # Total time : 0.086 s
% 0.78/0.58 # Maximum resident set size: 1616 pages
% 0.78/0.58
% 0.78/0.58 # -------------------------------------------------
% 0.78/0.58 # User time : 0.082 s
% 0.78/0.58 # System time : 0.008 s
% 0.78/0.58 # Total time : 0.089 s
% 0.78/0.58 # Maximum resident set size: 1680 pages
% 0.78/0.58 % E---3.1 exiting
%------------------------------------------------------------------------------