TSTP Solution File: FLD031-3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : FLD031-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:30:34 EDT 2023
% Result : Timeout 0.43s 300.10s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 25 ( 13 unt; 2 nHn; 25 RR)
% Number of literals : 44 ( 0 equ; 21 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 28 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_multiplication_1,axiom,
( product(X1,X2,X3)
| ~ product(X1,X4,X5)
| ~ product(X4,X6,X2)
| ~ product(X5,X6,X3) ),
file('/export/starexec/sandbox/tmp/tmp.B02CEgMIjt/E---3.1_8349.p',associativity_multiplication_1) ).
cnf(product_2,negated_conjecture,
product(multiplicative_identity,a,multiplicative_identity),
file('/export/starexec/sandbox/tmp/tmp.B02CEgMIjt/E---3.1_8349.p',product_2) ).
cnf(existence_of_identity_multiplication,axiom,
( product(multiplicative_identity,X1,X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.B02CEgMIjt/E---3.1_8349.p',existence_of_identity_multiplication) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/tmp/tmp.B02CEgMIjt/E---3.1_8349.p',a_is_defined) ).
cnf(commutativity_multiplication,axiom,
( product(X1,X2,X3)
| ~ product(X2,X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.B02CEgMIjt/E---3.1_8349.p',commutativity_multiplication) ).
cnf(existence_of_inverse_multiplication,axiom,
( product(multiplicative_inverse(X1),X1,multiplicative_identity)
| sum(additive_identity,X1,additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.B02CEgMIjt/E---3.1_8349.p',existence_of_inverse_multiplication) ).
cnf(not_sum_3,negated_conjecture,
~ sum(additive_identity,a,additive_identity),
file('/export/starexec/sandbox/tmp/tmp.B02CEgMIjt/E---3.1_8349.p',not_sum_3) ).
cnf(not_product_4,negated_conjecture,
~ product(multiplicative_identity,multiplicative_inverse(a),multiplicative_identity),
file('/export/starexec/sandbox/tmp/tmp.B02CEgMIjt/E---3.1_8349.p',not_product_4) ).
cnf(c_0_8,axiom,
( product(X1,X2,X3)
| ~ product(X1,X4,X5)
| ~ product(X4,X6,X2)
| ~ product(X5,X6,X3) ),
associativity_multiplication_1 ).
cnf(c_0_9,negated_conjecture,
product(multiplicative_identity,a,multiplicative_identity),
product_2 ).
cnf(c_0_10,axiom,
( product(multiplicative_identity,X1,X1)
| ~ defined(X1) ),
existence_of_identity_multiplication ).
cnf(c_0_11,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_12,negated_conjecture,
( product(X1,X2,multiplicative_identity)
| ~ product(X3,a,X2)
| ~ product(X1,X3,multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,hypothesis,
product(multiplicative_identity,a,a),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,axiom,
( product(X1,X2,X3)
| ~ product(X2,X1,X3) ),
commutativity_multiplication ).
cnf(c_0_15,hypothesis,
( product(X1,a,multiplicative_identity)
| ~ product(X1,multiplicative_identity,multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,hypothesis,
( product(a,X1,multiplicative_identity)
| ~ product(X1,multiplicative_identity,multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,negated_conjecture,
product(a,multiplicative_identity,multiplicative_identity),
inference(spm,[status(thm)],[c_0_14,c_0_9]) ).
cnf(c_0_18,negated_conjecture,
product(a,a,multiplicative_identity),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,negated_conjecture,
( product(X1,multiplicative_identity,multiplicative_identity)
| ~ product(X1,a,multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_12,c_0_18]) ).
cnf(c_0_20,axiom,
( product(multiplicative_inverse(X1),X1,multiplicative_identity)
| sum(additive_identity,X1,additive_identity)
| ~ defined(X1) ),
existence_of_inverse_multiplication ).
cnf(c_0_21,negated_conjecture,
~ sum(additive_identity,a,additive_identity),
not_sum_3 ).
cnf(c_0_22,negated_conjecture,
product(multiplicative_inverse(a),multiplicative_identity,multiplicative_identity),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_11])]),c_0_21]) ).
cnf(c_0_23,negated_conjecture,
~ product(multiplicative_identity,multiplicative_inverse(a),multiplicative_identity),
not_product_4 ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.14 % Problem : FLD031-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.11/0.15 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n013.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 : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 22:57:14 EDT 2023
% 0.13/0.36 % CPUTime :
% 0.19/0.50 Running first-order model finding
% 0.19/0.50 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.B02CEgMIjt/E---3.1_8349.p
% 0.43/300.10 # Version: 3.1pre001
% 0.43/300.10 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.43/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/300.10 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.43/300.10 # Starting new_bool_3 with 300s (1) cores
% 0.43/300.10 # Starting new_bool_1 with 300s (1) cores
% 0.43/300.10 # Starting sh5l with 300s (1) cores
% 0.43/300.10 # new_bool_1 with pid 8446 completed with status 0
% 0.43/300.10 # Result found by new_bool_1
% 0.43/300.10 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.43/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/300.10 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.43/300.10 # Starting new_bool_3 with 300s (1) cores
% 0.43/300.10 # Starting new_bool_1 with 300s (1) cores
% 0.43/300.10 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.43/300.10 # Search class: FGUNF-FFSS11-SFFFFFNN
% 0.43/300.10 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.43/300.10 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.43/300.10 # SAT001_MinMin_p005000_rr_RG with pid 8448 completed with status 0
% 0.43/300.10 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.43/300.10 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.43/300.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/300.10 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.43/300.10 # Starting new_bool_3 with 300s (1) cores
% 0.43/300.10 # Starting new_bool_1 with 300s (1) cores
% 0.43/300.10 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.43/300.10 # Search class: FGUNF-FFSS11-SFFFFFNN
% 0.43/300.10 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.43/300.10 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.43/300.10 # Preprocessing time : 0.001 s
% 0.43/300.10 # Presaturation interreduction done
% 0.43/300.10
% 0.43/300.10 # Proof found!
% 0.43/300.10 # SZS status Unsatisfiable
% 0.43/300.10 # SZS output start CNFRefutation
% See solution above
% 0.43/300.10 # Parsed axioms : 30
% 0.43/300.10 # Removed by relevancy pruning/SinE : 11
% 0.43/300.10 # Initial clauses : 19
% 0.43/300.10 # Removed in clause preprocessing : 0
% 0.43/300.10 # Initial clauses in saturation : 19
% 0.43/300.10 # Processed clauses : 97
% 0.43/300.10 # ...of these trivial : 0
% 0.43/300.10 # ...subsumed : 6
% 0.43/300.10 # ...remaining for further processing : 91
% 0.43/300.10 # Other redundant clauses eliminated : 0
% 0.43/300.10 # Clauses deleted for lack of memory : 0
% 0.43/300.10 # Backward-subsumed : 0
% 0.43/300.10 # Backward-rewritten : 0
% 0.43/300.10 # Generated clauses : 179
% 0.43/300.10 # ...of the previous two non-redundant : 147
% 0.43/300.10 # ...aggressively subsumed : 0
% 0.43/300.10 # Contextual simplify-reflections : 0
% 0.43/300.10 # Paramodulations : 179
% 0.43/300.10 # Factorizations : 0
% 0.43/300.10 # NegExts : 0
% 0.43/300.10 # Equation resolutions : 0
% 0.43/300.10 # Total rewrite steps : 28
% 0.43/300.10 # Propositional unsat checks : 0
% 0.43/300.10 # Propositional check models : 0
% 0.43/300.10 # Propositional check unsatisfiable : 0
% 0.43/300.10 # Propositional clauses : 0
% 0.43/300.10 # Propositional clauses after purity: 0
% 0.43/300.10 # Propositional unsat core size : 0
% 0.43/300.10 # Propositional preprocessing time : 0.000
% 0.43/300.10 # Propositional encoding time : 0.000
% 0.43/300.10 # Propositional solver time : 0.000
% 0.43/300.10 # Success case prop preproc time : 0.000
% 0.43/300.10 # Success case prop encoding time : 0.000
% 0.43/300.10 # Success case prop solver time : 0.000
% 0.43/300.10 # Current number of processed clauses : 72
% 0.43/300.10 # Positive orientable unit clauses : 17
% 0.43/300.10 # Positive unorientable unit clauses: 0
% 0.43/300.10 # Negative unit clauses : 3
% 0.43/300.10 # Non-unit-clauses : 52
% 0.43/300.10 # Current number of unprocessed clauses: 88
% 0.43/300.10 # ...number of literals in the above : 351
% 0.43/300.10 # Current number of archived formulas : 0
% 0.43/300.10 # Current number of archived clauses : 19
% 0.43/300.10 # Clause-clause subsumption calls (NU) : 359
% 0.43/300.10 # Rec. Clause-clause subsumption calls : 284
% 0.43/300.10 # Non-unit clause-clause subsumptions : 6
% 0.43/300.10 # Unit Clause-clause subsumption calls : 10
% 0.43/300.10 # Rewrite failures with RHS unbound : 0
% 0.43/300.10 # BW rewrite match attempts : 5
% 0.43/300.10 # BW rewrite match successes : 0
% 0.43/300.10 # Condensation attempts : 0
% 0.43/300.10 # Condensation successes : 0
% 0.43/300.10 # Termbank termtop insertions : 3095
% 0.43/300.10
% 0.43/300.10 # -------------------------------------------------
% 0.43/300.10 # User time : 0.007 s
% 0.43/300.10 # System time : 0.001 s
% 0.43/300.10 # Total time : 0.008 s
% 0.43/300.10 # Maximum resident set size: 1628 pages
% 0.43/300.10
% 0.43/300.10 # -------------------------------------------------
% 0.43/300.10 # User time : 0.008 s
% 0.43/300.10 # System time : 0.005 s
% 0.43/300.10 # Total time : 0.012 s
% 0.43/300.10 # Maximum resident set size: 1700 pages
% 0.43/300.10 % E---3.1 exiting
%------------------------------------------------------------------------------