TSTP Solution File: COM007+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : COM007+2 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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 : Mon May 20 19:07:12 EDT 2024
% Result : Theorem 0.16s 0.44s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 37 ( 11 unt; 0 def)
% Number of atoms : 78 ( 12 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 76 ( 35 ~; 31 |; 5 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-3 aty)
% Number of variables : 41 ( 0 sgn 20 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goal_to_be_proved,conjecture,
goal,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal_to_be_proved) ).
fof(goal_ax,axiom,
! [X1] :
( ( reflexive_rewrite(b,X1)
& reflexive_rewrite(c,X1) )
=> goal ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal_ax) ).
fof(rewrite_in_reflexive_rewrite,axiom,
! [X1,X2] :
( rewrite(X1,X2)
=> reflexive_rewrite(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rewrite_in_reflexive_rewrite) ).
fof(rewrite_diamond,axiom,
! [X1,X2,X3] :
( ( rewrite(X1,X2)
& rewrite(X1,X3) )
=> ? [X4] :
( rewrite(X2,X4)
& rewrite(X3,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rewrite_diamond) ).
fof(equal_or_rewrite,axiom,
! [X1,X2] :
( reflexive_rewrite(X1,X2)
=> ( X1 = X2
| rewrite(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_or_rewrite) ).
fof(equal_in_reflexive_rewrite,axiom,
! [X1,X2] :
( X1 = X2
=> reflexive_rewrite(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_in_reflexive_rewrite) ).
fof(assumption,axiom,
( reflexive_rewrite(a,b)
& reflexive_rewrite(a,c) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption) ).
fof(c_0_7,negated_conjecture,
~ goal,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[goal_to_be_proved])]) ).
fof(c_0_8,plain,
! [X5] :
( ~ reflexive_rewrite(b,X5)
| ~ reflexive_rewrite(c,X5)
| goal ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[goal_ax])])]) ).
fof(c_0_9,negated_conjecture,
~ goal,
inference(fof_nnf,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( goal
| ~ reflexive_rewrite(b,X1)
| ~ reflexive_rewrite(c,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
~ goal,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X8,X9] :
( ~ rewrite(X8,X9)
| reflexive_rewrite(X8,X9) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rewrite_in_reflexive_rewrite])])]) ).
cnf(c_0_13,plain,
( ~ reflexive_rewrite(b,X1)
| ~ reflexive_rewrite(c,X1) ),
inference(sr,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( reflexive_rewrite(X1,X2)
| ~ rewrite(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
( ~ rewrite(c,X1)
| ~ reflexive_rewrite(b,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_16,plain,
! [X12,X13,X14] :
( ( rewrite(X13,esk1_3(X12,X13,X14))
| ~ rewrite(X12,X13)
| ~ rewrite(X12,X14) )
& ( rewrite(X14,esk1_3(X12,X13,X14))
| ~ rewrite(X12,X13)
| ~ rewrite(X12,X14) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rewrite_diamond])])])])]) ).
cnf(c_0_17,plain,
( ~ rewrite(c,X1)
| ~ rewrite(b,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_18,plain,
( rewrite(X1,esk1_3(X2,X3,X1))
| ~ rewrite(X2,X3)
| ~ rewrite(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_19,plain,
! [X10,X11] :
( ~ reflexive_rewrite(X10,X11)
| X10 = X11
| rewrite(X10,X11) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_or_rewrite])])]) ).
fof(c_0_20,plain,
! [X6,X7] :
( X6 != X7
| reflexive_rewrite(X6,X7) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_in_reflexive_rewrite])])]) ).
cnf(c_0_21,plain,
( ~ rewrite(b,esk1_3(X1,X2,c))
| ~ rewrite(X1,c)
| ~ rewrite(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( rewrite(X1,esk1_3(X2,X1,X3))
| ~ rewrite(X2,X1)
| ~ rewrite(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( X1 = X2
| rewrite(X1,X2)
| ~ reflexive_rewrite(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
reflexive_rewrite(a,c),
inference(split_conjunct,[status(thm)],[assumption]) ).
cnf(c_0_25,plain,
( reflexive_rewrite(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
( ~ rewrite(X1,c)
| ~ rewrite(X1,b) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( c = a
| rewrite(a,c) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
reflexive_rewrite(a,b),
inference(split_conjunct,[status(thm)],[assumption]) ).
cnf(c_0_29,plain,
reflexive_rewrite(X1,X1),
inference(er,[status(thm)],[c_0_25]) ).
cnf(c_0_30,plain,
( c = a
| ~ rewrite(a,b) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
( a = b
| rewrite(a,b) ),
inference(spm,[status(thm)],[c_0_23,c_0_28]) ).
cnf(c_0_32,plain,
~ rewrite(c,b),
inference(spm,[status(thm)],[c_0_15,c_0_29]) ).
cnf(c_0_33,plain,
( a = b
| c = a ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,plain,
a = b,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_31]) ).
cnf(c_0_35,plain,
~ reflexive_rewrite(b,c),
inference(spm,[status(thm)],[c_0_13,c_0_29]) ).
cnf(c_0_36,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_34]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : COM007+2 : TPTP v8.2.0. Released v3.2.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n019.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Sun May 19 10:18:22 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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.16/0.44 # Version: 3.1.0
% 0.16/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # sh5l with pid 23692 completed with status 0
% 0.16/0.44 # Result found by sh5l
% 0.16/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.44 # Search class: FGUSF-FFSF33-SFFFFFNN
% 0.16/0.44 # partial match(1): FGUSF-FFSF32-SFFFFFNN
% 0.16/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.44 # SAT001_MinMin_p005000_rr_RG with pid 23696 completed with status 0
% 0.16/0.44 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.44 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.44 # Search class: FGUSF-FFSF33-SFFFFFNN
% 0.16/0.44 # partial match(1): FGUSF-FFSF32-SFFFFFNN
% 0.16/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.44 # Preprocessing time : 0.001 s
% 0.16/0.44 # Presaturation interreduction done
% 0.16/0.44
% 0.16/0.44 # Proof found!
% 0.16/0.44 # SZS status Theorem
% 0.16/0.44 # SZS output start CNFRefutation
% See solution above
% 0.16/0.44 # Parsed axioms : 7
% 0.16/0.44 # Removed by relevancy pruning/SinE : 0
% 0.16/0.44 # Initial clauses : 9
% 0.16/0.44 # Removed in clause preprocessing : 0
% 0.16/0.44 # Initial clauses in saturation : 9
% 0.16/0.44 # Processed clauses : 35
% 0.16/0.44 # ...of these trivial : 0
% 0.16/0.44 # ...subsumed : 1
% 0.16/0.44 # ...remaining for further processing : 34
% 0.16/0.44 # Other redundant clauses eliminated : 1
% 0.16/0.44 # Clauses deleted for lack of memory : 0
% 0.16/0.44 # Backward-subsumed : 0
% 0.16/0.44 # Backward-rewritten : 8
% 0.16/0.44 # Generated clauses : 25
% 0.16/0.44 # ...of the previous two non-redundant : 25
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 1
% 0.16/0.44 # Paramodulations : 24
% 0.16/0.44 # Factorizations : 0
% 0.16/0.44 # NegExts : 0
% 0.16/0.44 # Equation resolutions : 1
% 0.16/0.44 # Disequality decompositions : 0
% 0.16/0.44 # Total rewrite steps : 17
% 0.16/0.44 # ...of those cached : 14
% 0.16/0.44 # Propositional unsat checks : 0
% 0.16/0.44 # Propositional check models : 0
% 0.16/0.44 # Propositional check unsatisfiable : 0
% 0.16/0.44 # Propositional clauses : 0
% 0.16/0.44 # Propositional clauses after purity: 0
% 0.16/0.44 # Propositional unsat core size : 0
% 0.16/0.44 # Propositional preprocessing time : 0.000
% 0.16/0.44 # Propositional encoding time : 0.000
% 0.16/0.44 # Propositional solver time : 0.000
% 0.16/0.44 # Success case prop preproc time : 0.000
% 0.16/0.44 # Success case prop encoding time : 0.000
% 0.16/0.44 # Success case prop solver time : 0.000
% 0.16/0.44 # Current number of processed clauses : 16
% 0.16/0.44 # Positive orientable unit clauses : 2
% 0.16/0.44 # Positive unorientable unit clauses: 0
% 0.16/0.44 # Negative unit clauses : 4
% 0.16/0.44 # Non-unit-clauses : 10
% 0.16/0.44 # Current number of unprocessed clauses: 6
% 0.16/0.44 # ...number of literals in the above : 19
% 0.16/0.44 # Current number of archived formulas : 0
% 0.16/0.44 # Current number of archived clauses : 17
% 0.16/0.44 # Clause-clause subsumption calls (NU) : 24
% 0.16/0.44 # Rec. Clause-clause subsumption calls : 18
% 0.16/0.44 # Non-unit clause-clause subsumptions : 2
% 0.16/0.44 # Unit Clause-clause subsumption calls : 3
% 0.16/0.44 # Rewrite failures with RHS unbound : 0
% 0.16/0.44 # BW rewrite match attempts : 7
% 0.16/0.44 # BW rewrite match successes : 1
% 0.16/0.44 # Condensation attempts : 0
% 0.16/0.44 # Condensation successes : 0
% 0.16/0.44 # Termbank termtop insertions : 726
% 0.16/0.44 # Search garbage collected termcells : 88
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.003 s
% 0.16/0.44 # System time : 0.002 s
% 0.16/0.44 # Total time : 0.005 s
% 0.16/0.44 # Maximum resident set size: 1772 pages
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.004 s
% 0.16/0.44 # System time : 0.004 s
% 0.16/0.44 # Total time : 0.008 s
% 0.16/0.44 # Maximum resident set size: 1692 pages
% 0.16/0.44 % E---3.1 exiting
% 0.16/0.44 % E exiting
%------------------------------------------------------------------------------