TSTP Solution File: RNG007-4 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : RNG007-4 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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 : Tue May 21 02:36:34 EDT 2024
% Result : Unsatisfiable 0.19s 0.47s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 22 ( 22 unt; 0 nHn; 4 RR)
% Number of literals : 22 ( 21 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(multiply_additive_inverse1,axiom,
multiply(X1,additive_inverse(X2)) = additive_inverse(multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG002-0.ax',multiply_additive_inverse1) ).
cnf(boolean_ring,hypothesis,
multiply(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',boolean_ring) ).
cnf(additive_inverse_additive_inverse,axiom,
additive_inverse(additive_inverse(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/RNG002-0.ax',additive_inverse_additive_inverse) ).
cnf(multiply_additive_inverse2,axiom,
multiply(additive_inverse(X1),X2) = additive_inverse(multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG002-0.ax',multiply_additive_inverse2) ).
cnf(left_additive_inverse,axiom,
add(additive_inverse(X1),X1) = additive_identity,
file('/export/starexec/sandbox/benchmark/Axioms/RNG002-0.ax',left_additive_inverse) ).
cnf(commutative_addition,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/RNG002-0.ax',commutative_addition) ).
cnf(prove_inverse,negated_conjecture,
add(a,a) != additive_identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_inverse) ).
cnf(c_0_7,axiom,
multiply(X1,additive_inverse(X2)) = additive_inverse(multiply(X1,X2)),
multiply_additive_inverse1 ).
cnf(c_0_8,hypothesis,
multiply(X1,X1) = X1,
boolean_ring ).
cnf(c_0_9,hypothesis,
multiply(X1,additive_inverse(X1)) = additive_inverse(X1),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,axiom,
additive_inverse(additive_inverse(X1)) = X1,
additive_inverse_additive_inverse ).
cnf(c_0_11,axiom,
multiply(additive_inverse(X1),X2) = additive_inverse(multiply(X1,X2)),
multiply_additive_inverse2 ).
cnf(c_0_12,axiom,
add(additive_inverse(X1),X1) = additive_identity,
left_additive_inverse ).
cnf(c_0_13,axiom,
add(X1,X2) = add(X2,X1),
commutative_addition ).
cnf(c_0_14,hypothesis,
multiply(additive_inverse(X1),X1) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,plain,
multiply(additive_inverse(X1),X2) = multiply(X1,additive_inverse(X2)),
inference(rw,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_16,negated_conjecture,
add(a,a) != additive_identity,
inference(fof_simplification,[status(thm)],[prove_inverse]) ).
cnf(c_0_17,plain,
add(X1,additive_inverse(X1)) = additive_identity,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,hypothesis,
additive_inverse(X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_9]) ).
cnf(c_0_19,negated_conjecture,
add(a,a) != additive_identity,
c_0_16 ).
cnf(c_0_20,plain,
add(X1,X1) = additive_identity,
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : RNG007-4 : TPTP v8.2.0. Released v1.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n021.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat May 18 11:58:07 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order model finding
% 0.19/0.46 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/benchmark/theBenchmark.p
% 0.19/0.47 # Version: 3.1.0
% 0.19/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.47 # Starting sh5l with 300s (1) cores
% 0.19/0.47 # new_bool_3 with pid 29204 completed with status 0
% 0.19/0.47 # Result found by new_bool_3
% 0.19/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.47 # Search class: FUUPM-FFSF21-SFFFFFNN
% 0.19/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.19/0.47 # U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 29207 completed with status 0
% 0.19/0.47 # Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.47 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.47 # Search class: FUUPM-FFSF21-SFFFFFNN
% 0.19/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.19/0.47 # Preprocessing time : 0.001 s
% 0.19/0.47 # Presaturation interreduction done
% 0.19/0.47
% 0.19/0.47 # Proof found!
% 0.19/0.47 # SZS status Unsatisfiable
% 0.19/0.47 # SZS output start CNFRefutation
% See solution above
% 0.19/0.47 # Parsed axioms : 16
% 0.19/0.47 # Removed by relevancy pruning/SinE : 0
% 0.19/0.47 # Initial clauses : 16
% 0.19/0.47 # Removed in clause preprocessing : 0
% 0.19/0.47 # Initial clauses in saturation : 16
% 0.19/0.47 # Processed clauses : 31
% 0.19/0.47 # ...of these trivial : 0
% 0.19/0.47 # ...subsumed : 0
% 0.19/0.47 # ...remaining for further processing : 31
% 0.19/0.47 # Other redundant clauses eliminated : 0
% 0.19/0.47 # Clauses deleted for lack of memory : 0
% 0.19/0.47 # Backward-subsumed : 0
% 0.19/0.47 # Backward-rewritten : 9
% 0.19/0.47 # Generated clauses : 25
% 0.19/0.47 # ...of the previous two non-redundant : 11
% 0.19/0.47 # ...aggressively subsumed : 0
% 0.19/0.47 # Contextual simplify-reflections : 0
% 0.19/0.47 # Paramodulations : 25
% 0.19/0.47 # Factorizations : 0
% 0.19/0.47 # NegExts : 0
% 0.19/0.47 # Equation resolutions : 0
% 0.19/0.47 # Disequality decompositions : 0
% 0.19/0.47 # Total rewrite steps : 51
% 0.19/0.47 # ...of those cached : 27
% 0.19/0.47 # Propositional unsat checks : 0
% 0.19/0.47 # Propositional check models : 0
% 0.19/0.47 # Propositional check unsatisfiable : 0
% 0.19/0.47 # Propositional clauses : 0
% 0.19/0.47 # Propositional clauses after purity: 0
% 0.19/0.47 # Propositional unsat core size : 0
% 0.19/0.47 # Propositional preprocessing time : 0.000
% 0.19/0.47 # Propositional encoding time : 0.000
% 0.19/0.47 # Propositional solver time : 0.000
% 0.19/0.47 # Success case prop preproc time : 0.000
% 0.19/0.47 # Success case prop encoding time : 0.000
% 0.19/0.47 # Success case prop solver time : 0.000
% 0.19/0.47 # Current number of processed clauses : 6
% 0.19/0.47 # Positive orientable unit clauses : 6
% 0.19/0.47 # Positive unorientable unit clauses: 0
% 0.19/0.47 # Negative unit clauses : 0
% 0.19/0.47 # Non-unit-clauses : 0
% 0.19/0.47 # Current number of unprocessed clauses: 10
% 0.19/0.47 # ...number of literals in the above : 10
% 0.19/0.47 # Current number of archived formulas : 0
% 0.19/0.47 # Current number of archived clauses : 25
% 0.19/0.47 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.47 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.47 # Non-unit clause-clause subsumptions : 0
% 0.19/0.47 # Unit Clause-clause subsumption calls : 0
% 0.19/0.47 # Rewrite failures with RHS unbound : 0
% 0.19/0.47 # BW rewrite match attempts : 18
% 0.19/0.47 # BW rewrite match successes : 13
% 0.19/0.47 # Condensation attempts : 0
% 0.19/0.47 # Condensation successes : 0
% 0.19/0.47 # Termbank termtop insertions : 436
% 0.19/0.47 # Search garbage collected termcells : 2
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.002 s
% 0.19/0.47 # System time : 0.002 s
% 0.19/0.47 # Total time : 0.004 s
% 0.19/0.47 # Maximum resident set size: 1620 pages
% 0.19/0.47
% 0.19/0.47 # -------------------------------------------------
% 0.19/0.47 # User time : 0.002 s
% 0.19/0.47 # System time : 0.006 s
% 0.19/0.47 # Total time : 0.008 s
% 0.19/0.47 # Maximum resident set size: 1696 pages
% 0.19/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------