TSTP Solution File: FLD038-3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : FLD038-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:36 EDT 2023
% Result : Unsatisfiable 0.22s 0.54s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 25 ( 14 unt; 3 nHn; 25 RR)
% Number of literals : 44 ( 0 equ; 20 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 : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(existence_of_identity_multiplication,axiom,
( product(multiplicative_identity,X1,X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox/tmp/tmp.4pZpWmxtpp/E---3.1_20938.p',existence_of_identity_multiplication) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/tmp/tmp.4pZpWmxtpp/E---3.1_20938.p',b_is_defined) ).
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.4pZpWmxtpp/E---3.1_20938.p',associativity_multiplication_1) ).
cnf(commutativity_multiplication,axiom,
( product(X1,X2,X3)
| ~ product(X2,X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.4pZpWmxtpp/E---3.1_20938.p',commutativity_multiplication) ).
cnf(product_4,negated_conjecture,
product(b,multiplicative_inverse(a),multiplicative_identity),
file('/export/starexec/sandbox/tmp/tmp.4pZpWmxtpp/E---3.1_20938.p',product_4) ).
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.4pZpWmxtpp/E---3.1_20938.p',existence_of_inverse_multiplication) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/tmp/tmp.4pZpWmxtpp/E---3.1_20938.p',a_is_defined) ).
cnf(not_sum_3,negated_conjecture,
~ sum(additive_identity,a,additive_identity),
file('/export/starexec/sandbox/tmp/tmp.4pZpWmxtpp/E---3.1_20938.p',not_sum_3) ).
cnf(not_product_5,negated_conjecture,
~ product(multiplicative_identity,a,b),
file('/export/starexec/sandbox/tmp/tmp.4pZpWmxtpp/E---3.1_20938.p',not_product_5) ).
cnf(c_0_9,axiom,
( product(multiplicative_identity,X1,X1)
| ~ defined(X1) ),
existence_of_identity_multiplication ).
cnf(c_0_10,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_11,axiom,
( product(X1,X2,X3)
| ~ product(X1,X4,X5)
| ~ product(X4,X6,X2)
| ~ product(X5,X6,X3) ),
associativity_multiplication_1 ).
cnf(c_0_12,hypothesis,
product(multiplicative_identity,b,b),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,axiom,
( product(X1,X2,X3)
| ~ product(X2,X1,X3) ),
commutativity_multiplication ).
cnf(c_0_14,negated_conjecture,
product(b,multiplicative_inverse(a),multiplicative_identity),
product_4 ).
cnf(c_0_15,hypothesis,
( product(X1,X2,b)
| ~ product(X3,b,X2)
| ~ product(X1,X3,multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
product(multiplicative_inverse(a),b,multiplicative_identity),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,axiom,
( product(multiplicative_inverse(X1),X1,multiplicative_identity)
| sum(additive_identity,X1,additive_identity)
| ~ defined(X1) ),
existence_of_inverse_multiplication ).
cnf(c_0_18,negated_conjecture,
( product(X1,multiplicative_identity,b)
| ~ product(X1,multiplicative_inverse(a),multiplicative_identity) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( product(X1,multiplicative_inverse(X1),multiplicative_identity)
| sum(additive_identity,X1,additive_identity)
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
cnf(c_0_20,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_21,negated_conjecture,
~ sum(additive_identity,a,additive_identity),
not_sum_3 ).
cnf(c_0_22,negated_conjecture,
product(a,multiplicative_identity,b),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),c_0_21]) ).
cnf(c_0_23,negated_conjecture,
~ product(multiplicative_identity,a,b),
not_product_5 ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : FLD038-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n027.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 2400
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon Oct 2 23:39:16 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.22/0.52 Running first-order model finding
% 0.22/0.52 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.4pZpWmxtpp/E---3.1_20938.p
% 0.22/0.54 # Version: 3.1pre001
% 0.22/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.54 # Starting sh5l with 300s (1) cores
% 0.22/0.54 # new_bool_3 with pid 21016 completed with status 0
% 0.22/0.54 # Result found by new_bool_3
% 0.22/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.54 # Search class: FGUNF-FFSS11-SFFFFFNN
% 0.22/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.54 # SAT001_MinMin_p005000_rr_RG with pid 21020 completed with status 0
% 0.22/0.54 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.54 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.54 # Search class: FGUNF-FFSS11-SFFFFFNN
% 0.22/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.54 # Preprocessing time : 0.001 s
% 0.22/0.54 # Presaturation interreduction done
% 0.22/0.54
% 0.22/0.54 # Proof found!
% 0.22/0.54 # SZS status Unsatisfiable
% 0.22/0.54 # SZS output start CNFRefutation
% See solution above
% 0.22/0.54 # Parsed axioms : 31
% 0.22/0.54 # Removed by relevancy pruning/SinE : 11
% 0.22/0.54 # Initial clauses : 20
% 0.22/0.54 # Removed in clause preprocessing : 0
% 0.22/0.54 # Initial clauses in saturation : 20
% 0.22/0.54 # Processed clauses : 95
% 0.22/0.54 # ...of these trivial : 0
% 0.22/0.54 # ...subsumed : 6
% 0.22/0.54 # ...remaining for further processing : 89
% 0.22/0.54 # Other redundant clauses eliminated : 0
% 0.22/0.54 # Clauses deleted for lack of memory : 0
% 0.22/0.54 # Backward-subsumed : 0
% 0.22/0.54 # Backward-rewritten : 0
% 0.22/0.54 # Generated clauses : 152
% 0.22/0.54 # ...of the previous two non-redundant : 124
% 0.22/0.54 # ...aggressively subsumed : 0
% 0.22/0.54 # Contextual simplify-reflections : 0
% 0.22/0.54 # Paramodulations : 152
% 0.22/0.54 # Factorizations : 0
% 0.22/0.54 # NegExts : 0
% 0.22/0.54 # Equation resolutions : 0
% 0.22/0.54 # Total rewrite steps : 24
% 0.22/0.54 # Propositional unsat checks : 0
% 0.22/0.54 # Propositional check models : 0
% 0.22/0.54 # Propositional check unsatisfiable : 0
% 0.22/0.54 # Propositional clauses : 0
% 0.22/0.54 # Propositional clauses after purity: 0
% 0.22/0.54 # Propositional unsat core size : 0
% 0.22/0.54 # Propositional preprocessing time : 0.000
% 0.22/0.54 # Propositional encoding time : 0.000
% 0.22/0.54 # Propositional solver time : 0.000
% 0.22/0.54 # Success case prop preproc time : 0.000
% 0.22/0.54 # Success case prop encoding time : 0.000
% 0.22/0.54 # Success case prop solver time : 0.000
% 0.22/0.54 # Current number of processed clauses : 69
% 0.22/0.54 # Positive orientable unit clauses : 21
% 0.22/0.54 # Positive unorientable unit clauses: 0
% 0.22/0.54 # Negative unit clauses : 3
% 0.22/0.54 # Non-unit-clauses : 45
% 0.22/0.54 # Current number of unprocessed clauses: 69
% 0.22/0.54 # ...number of literals in the above : 260
% 0.22/0.54 # Current number of archived formulas : 0
% 0.22/0.54 # Current number of archived clauses : 20
% 0.22/0.54 # Clause-clause subsumption calls (NU) : 247
% 0.22/0.54 # Rec. Clause-clause subsumption calls : 247
% 0.22/0.54 # Non-unit clause-clause subsumptions : 6
% 0.22/0.54 # Unit Clause-clause subsumption calls : 4
% 0.22/0.54 # Rewrite failures with RHS unbound : 0
% 0.22/0.54 # BW rewrite match attempts : 4
% 0.22/0.54 # BW rewrite match successes : 0
% 0.22/0.54 # Condensation attempts : 0
% 0.22/0.54 # Condensation successes : 0
% 0.22/0.54 # Termbank termtop insertions : 2625
% 0.22/0.54
% 0.22/0.54 # -------------------------------------------------
% 0.22/0.54 # User time : 0.005 s
% 0.22/0.54 # System time : 0.002 s
% 0.22/0.54 # Total time : 0.008 s
% 0.22/0.54 # Maximum resident set size: 1612 pages
% 0.22/0.54
% 0.22/0.54 # -------------------------------------------------
% 0.22/0.54 # User time : 0.008 s
% 0.22/0.54 # System time : 0.004 s
% 0.22/0.54 # Total time : 0.011 s
% 0.22/0.54 # Maximum resident set size: 1696 pages
% 0.22/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------