TSTP Solution File: RNG128-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : RNG128-1 : TPTP v8.2.0. Released v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:31 EDT 2024
% Result : Unsatisfiable 0.14s 0.40s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 7
% Syntax : Number of clauses : 41 ( 41 unt; 0 nHn; 6 RR)
% Number of literals : 41 ( 40 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 58 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(sos_006,axiom,
add(unit,add(X1,mult(X1,X1))) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_006) ).
cnf(sos_005,axiom,
mult(X1,unit) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_005) ).
cnf(sos,axiom,
add(X1,add(X2,X3)) = add(add(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos) ).
cnf(sos_003,axiom,
mult(X1,add(X2,X3)) = add(mult(X1,X2),mult(X1,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_003) ).
cnf(sos_001,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_001) ).
cnf(goals,negated_conjecture,
add(x0,x1) != mult(x0,x1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(sos_002,axiom,
mult(X1,X2) = mult(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_002) ).
cnf(c_0_7,axiom,
add(unit,add(X1,mult(X1,X1))) = X1,
sos_006 ).
cnf(c_0_8,axiom,
mult(X1,unit) = X1,
sos_005 ).
cnf(c_0_9,axiom,
add(X1,add(X2,X3)) = add(add(X1,X2),X3),
sos ).
cnf(c_0_10,plain,
add(unit,add(unit,unit)) = unit,
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
add(unit,add(unit,add(unit,X1))) = add(unit,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_9]) ).
cnf(c_0_12,plain,
add(unit,add(unit,X1)) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_13,axiom,
mult(X1,add(X2,X3)) = add(mult(X1,X2),mult(X1,X3)),
sos_003 ).
cnf(c_0_14,axiom,
add(X1,X2) = add(X2,X1),
sos_001 ).
cnf(c_0_15,plain,
add(X1,mult(X1,X1)) = add(unit,X1),
inference(spm,[status(thm)],[c_0_12,c_0_7]) ).
cnf(c_0_16,plain,
add(X1,mult(X1,X2)) = mult(X1,add(X2,unit)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_8]),c_0_14]) ).
cnf(c_0_17,plain,
mult(X1,add(X1,unit)) = add(unit,X1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,plain,
add(X1,add(X2,X3)) = add(X3,add(X1,X2)),
inference(spm,[status(thm)],[c_0_14,c_0_9]) ).
cnf(c_0_19,plain,
mult(X1,add(unit,X1)) = add(unit,X1),
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_20,plain,
add(X1,add(unit,unit)) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_21,plain,
add(unit,unit) = unit,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_8]) ).
cnf(c_0_22,plain,
add(X1,add(unit,X1)) = mult(X1,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_9]),c_0_20]) ).
cnf(c_0_23,plain,
add(unit,add(X1,unit)) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_24,plain,
add(X1,unit) = X1,
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
add(X1,add(X1,unit)) = mult(X1,X1),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_26,plain,
add(unit,X1) = X1,
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
mult(X1,X1) = add(X1,X1),
inference(rw,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_28,plain,
add(X1,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_26]),c_0_27]),c_0_26]) ).
cnf(c_0_29,plain,
mult(X1,X1) = X1,
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,plain,
add(X1,mult(X1,X2)) = mult(X1,X2),
inference(rw,[status(thm)],[c_0_16,c_0_24]) ).
cnf(c_0_31,plain,
mult(X1,add(X1,X2)) = mult(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_29]),c_0_30]) ).
cnf(c_0_32,plain,
add(X1,add(X2,X3)) = add(X2,add(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_14]),c_0_9]) ).
cnf(c_0_33,negated_conjecture,
add(x0,x1) != mult(x0,x1),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_34,plain,
mult(X1,add(X2,X1)) = mult(X1,X2),
inference(spm,[status(thm)],[c_0_31,c_0_14]) ).
cnf(c_0_35,plain,
add(X1,add(X1,X2)) = add(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_28]),c_0_9]),c_0_28]) ).
cnf(c_0_36,plain,
add(X1,add(X2,X1)) = add(X2,X1),
inference(spm,[status(thm)],[c_0_18,c_0_28]) ).
cnf(c_0_37,axiom,
mult(X1,X2) = mult(X2,X1),
sos_002 ).
cnf(c_0_38,negated_conjecture,
add(x0,x1) != mult(x0,x1),
c_0_33 ).
cnf(c_0_39,plain,
mult(X1,X2) = add(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_27]),c_0_9]),c_0_36]),c_0_35]),c_0_37]),c_0_31]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : RNG128-1 : TPTP v8.2.0. Released v5.4.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n017.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Sat May 18 12:08:08 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.14/0.38 Running first-order theorem proving
% 0.14/0.38 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.40 # Version: 3.1.0
% 0.14/0.40 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.40 # Starting sh5l with 300s (1) cores
% 0.14/0.40 # sh5l with pid 28921 completed with status 0
% 0.14/0.40 # Result found by sh5l
% 0.14/0.40 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.40 # Starting sh5l with 300s (1) cores
% 0.14/0.40 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.40 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.14/0.40 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.40 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 82s (1) cores
% 0.14/0.40 # G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with pid 28924 completed with status 0
% 0.14/0.40 # Result found by G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 0.14/0.40 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.40 # Starting sh5l with 300s (1) cores
% 0.14/0.40 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.40 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.14/0.40 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.40 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 82s (1) cores
% 0.14/0.40 # Preprocessing time : 0.001 s
% 0.14/0.40 # Presaturation interreduction done
% 0.14/0.40
% 0.14/0.40 # Proof found!
% 0.14/0.40 # SZS status Unsatisfiable
% 0.14/0.40 # SZS output start CNFRefutation
% See solution above
% 0.14/0.40 # Parsed axioms : 8
% 0.14/0.40 # Removed by relevancy pruning/SinE : 1
% 0.14/0.40 # Initial clauses : 7
% 0.14/0.40 # Removed in clause preprocessing : 0
% 0.14/0.40 # Initial clauses in saturation : 7
% 0.14/0.40 # Processed clauses : 115
% 0.14/0.40 # ...of these trivial : 26
% 0.14/0.40 # ...subsumed : 40
% 0.14/0.40 # ...remaining for further processing : 49
% 0.14/0.40 # Other redundant clauses eliminated : 0
% 0.14/0.40 # Clauses deleted for lack of memory : 0
% 0.14/0.40 # Backward-subsumed : 0
% 0.14/0.40 # Backward-rewritten : 32
% 0.14/0.40 # Generated clauses : 686
% 0.14/0.40 # ...of the previous two non-redundant : 495
% 0.14/0.40 # ...aggressively subsumed : 0
% 0.14/0.40 # Contextual simplify-reflections : 0
% 0.14/0.40 # Paramodulations : 686
% 0.14/0.40 # Factorizations : 0
% 0.14/0.40 # NegExts : 0
% 0.14/0.40 # Equation resolutions : 0
% 0.14/0.40 # Disequality decompositions : 0
% 0.14/0.40 # Total rewrite steps : 773
% 0.14/0.40 # ...of those cached : 527
% 0.14/0.40 # Propositional unsat checks : 0
% 0.14/0.40 # Propositional check models : 0
% 0.14/0.40 # Propositional check unsatisfiable : 0
% 0.14/0.40 # Propositional clauses : 0
% 0.14/0.40 # Propositional clauses after purity: 0
% 0.14/0.40 # Propositional unsat core size : 0
% 0.14/0.40 # Propositional preprocessing time : 0.000
% 0.14/0.40 # Propositional encoding time : 0.000
% 0.14/0.40 # Propositional solver time : 0.000
% 0.14/0.40 # Success case prop preproc time : 0.000
% 0.14/0.40 # Success case prop encoding time : 0.000
% 0.14/0.40 # Success case prop solver time : 0.000
% 0.14/0.40 # Current number of processed clauses : 10
% 0.14/0.40 # Positive orientable unit clauses : 7
% 0.14/0.40 # Positive unorientable unit clauses: 3
% 0.14/0.40 # Negative unit clauses : 0
% 0.14/0.40 # Non-unit-clauses : 0
% 0.14/0.40 # Current number of unprocessed clauses: 350
% 0.14/0.40 # ...number of literals in the above : 350
% 0.14/0.40 # Current number of archived formulas : 0
% 0.14/0.40 # Current number of archived clauses : 39
% 0.14/0.40 # Clause-clause subsumption calls (NU) : 0
% 0.14/0.40 # Rec. Clause-clause subsumption calls : 0
% 0.14/0.40 # Non-unit clause-clause subsumptions : 0
% 0.14/0.40 # Unit Clause-clause subsumption calls : 6
% 0.14/0.40 # Rewrite failures with RHS unbound : 0
% 0.14/0.40 # BW rewrite match attempts : 139
% 0.14/0.40 # BW rewrite match successes : 72
% 0.14/0.40 # Condensation attempts : 0
% 0.14/0.40 # Condensation successes : 0
% 0.14/0.40 # Termbank termtop insertions : 5312
% 0.14/0.40 # Search garbage collected termcells : 5
% 0.14/0.40
% 0.14/0.40 # -------------------------------------------------
% 0.14/0.40 # User time : 0.007 s
% 0.14/0.40 # System time : 0.001 s
% 0.14/0.40 # Total time : 0.008 s
% 0.14/0.40 # Maximum resident set size: 1608 pages
% 0.14/0.40
% 0.14/0.40 # -------------------------------------------------
% 0.14/0.40 # User time : 0.007 s
% 0.14/0.40 # System time : 0.003 s
% 0.14/0.40 # Total time : 0.010 s
% 0.14/0.40 # Maximum resident set size: 1688 pages
% 0.14/0.40 % E---3.1 exiting
% 0.14/0.40 % E exiting
%------------------------------------------------------------------------------