TSTP Solution File: COM007+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : COM007+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 : Sat May 4 07:30:46 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 46 ( 13 unt; 0 def)
% Number of atoms : 104 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 103 ( 45 ~; 45 |; 6 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-3 aty)
% Number of variables : 70 ( 0 sgn 32 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goal_to_be_proved,conjecture,
goal,
file('/export/starexec/sandbox2/tmp/tmp.X53p4hrkQ5/E---3.1_2480.p',goal_to_be_proved) ).
fof(goal_ax,axiom,
! [X1] :
( ( reflexive_rewrite(b,X1)
& reflexive_rewrite(c,X1) )
=> goal ),
file('/export/starexec/sandbox2/tmp/tmp.X53p4hrkQ5/E---3.1_2480.p',goal_ax) ).
fof(rewrite_in_reflexive_rewrite,axiom,
! [X1,X2] :
( rewrite(X1,X2)
=> reflexive_rewrite(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.X53p4hrkQ5/E---3.1_2480.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/tmp/tmp.X53p4hrkQ5/E---3.1_2480.p',rewrite_diamond) ).
fof(symmtery,axiom,
! [X1,X2] :
( equalish(X1,X2)
=> equalish(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.X53p4hrkQ5/E---3.1_2480.p',symmtery) ).
fof(equalish_or_rewrite,axiom,
! [X1,X2] :
( reflexive_rewrite(X1,X2)
=> ( equalish(X1,X2)
| rewrite(X1,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.X53p4hrkQ5/E---3.1_2480.p',equalish_or_rewrite) ).
fof(substitution,axiom,
! [X1,X2,X3] :
( ( equalish(X1,X2)
& reflexive_rewrite(X2,X3) )
=> reflexive_rewrite(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.X53p4hrkQ5/E---3.1_2480.p',substitution) ).
fof(equalish_in_reflexive_rewrite,axiom,
! [X1,X2] :
( equalish(X1,X2)
=> reflexive_rewrite(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.X53p4hrkQ5/E---3.1_2480.p',equalish_in_reflexive_rewrite) ).
fof(reflexivity,axiom,
! [X1] : equalish(X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.X53p4hrkQ5/E---3.1_2480.p',reflexivity) ).
fof(assumption,axiom,
( reflexive_rewrite(a,b)
& reflexive_rewrite(a,c) ),
file('/export/starexec/sandbox2/tmp/tmp.X53p4hrkQ5/E---3.1_2480.p',assumption) ).
fof(c_0_10,negated_conjecture,
~ goal,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[goal_to_be_proved])]) ).
fof(c_0_11,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_12,negated_conjecture,
~ goal,
inference(fof_nnf,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X11,X12] :
( ~ rewrite(X11,X12)
| reflexive_rewrite(X11,X12) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rewrite_in_reflexive_rewrite])])]) ).
fof(c_0_14,plain,
! [X18,X19,X20] :
( ( rewrite(X19,esk1_3(X18,X19,X20))
| ~ rewrite(X18,X19)
| ~ rewrite(X18,X20) )
& ( rewrite(X20,esk1_3(X18,X19,X20))
| ~ rewrite(X18,X19)
| ~ rewrite(X18,X20) ) ),
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])])])])]) ).
fof(c_0_15,plain,
! [X16,X17] :
( ~ equalish(X16,X17)
| equalish(X17,X16) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[symmtery])])]) ).
fof(c_0_16,plain,
! [X13,X14] :
( ~ reflexive_rewrite(X13,X14)
| equalish(X13,X14)
| rewrite(X13,X14) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equalish_or_rewrite])])]) ).
cnf(c_0_17,plain,
( goal
| ~ reflexive_rewrite(b,X1)
| ~ reflexive_rewrite(c,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
~ goal,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( reflexive_rewrite(X1,X2)
| ~ rewrite(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( rewrite(X1,esk1_3(X2,X3,X1))
| ~ rewrite(X2,X3)
| ~ rewrite(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_21,plain,
! [X6,X7,X8] :
( ~ equalish(X6,X7)
| ~ reflexive_rewrite(X7,X8)
| reflexive_rewrite(X6,X8) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[substitution])])]) ).
cnf(c_0_22,plain,
( equalish(X2,X1)
| ~ equalish(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
( equalish(X1,X2)
| rewrite(X1,X2)
| ~ reflexive_rewrite(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( ~ reflexive_rewrite(b,X1)
| ~ reflexive_rewrite(c,X1) ),
inference(sr,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,plain,
( reflexive_rewrite(X1,esk1_3(X2,X3,X1))
| ~ rewrite(X2,X3)
| ~ rewrite(X2,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( rewrite(X1,esk1_3(X2,X1,X3))
| ~ rewrite(X2,X1)
| ~ rewrite(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_27,plain,
( reflexive_rewrite(X1,X3)
| ~ equalish(X1,X2)
| ~ reflexive_rewrite(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
( rewrite(X1,X2)
| equalish(X2,X1)
| ~ reflexive_rewrite(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_29,plain,
! [X9,X10] :
( ~ equalish(X9,X10)
| reflexive_rewrite(X9,X10) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equalish_in_reflexive_rewrite])])]) ).
fof(c_0_30,plain,
! [X15] : equalish(X15,X15),
inference(variable_rename,[status(thm)],[reflexivity]) ).
cnf(c_0_31,plain,
( ~ rewrite(X1,c)
| ~ rewrite(X1,X2)
| ~ reflexive_rewrite(b,esk1_3(X1,X2,c)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,plain,
( reflexive_rewrite(X1,esk1_3(X2,X1,X3))
| ~ rewrite(X2,X3)
| ~ rewrite(X2,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_26]) ).
cnf(c_0_33,plain,
( rewrite(X1,X2)
| reflexive_rewrite(X2,X3)
| ~ reflexive_rewrite(X1,X3)
| ~ reflexive_rewrite(X1,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
reflexive_rewrite(a,b),
inference(split_conjunct,[status(thm)],[assumption]) ).
cnf(c_0_35,plain,
( reflexive_rewrite(X1,X2)
| ~ equalish(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_36,plain,
equalish(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,plain,
( ~ rewrite(X1,c)
| ~ rewrite(X1,b) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,plain,
( rewrite(a,X1)
| reflexive_rewrite(X1,b)
| ~ reflexive_rewrite(a,X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
reflexive_rewrite(a,c),
inference(split_conjunct,[status(thm)],[assumption]) ).
cnf(c_0_40,plain,
reflexive_rewrite(X1,X1),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,plain,
( reflexive_rewrite(c,b)
| ~ rewrite(a,b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).
cnf(c_0_42,plain,
( rewrite(a,X1)
| reflexive_rewrite(X1,c)
| ~ reflexive_rewrite(a,X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_39]) ).
cnf(c_0_43,plain,
~ reflexive_rewrite(b,c),
inference(spm,[status(thm)],[c_0_24,c_0_40]) ).
cnf(c_0_44,plain,
reflexive_rewrite(c,b),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_34])]),c_0_43]) ).
cnf(c_0_45,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_44]),c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COM007+1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n016.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % 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 : Fri May 3 17:26:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.X53p4hrkQ5/E---3.1_2480.p
% 0.20/0.49 # Version: 3.1.0
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # sh5l with pid 2560 completed with status 0
% 0.20/0.49 # Result found by sh5l
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.49 # Search class: FGUNF-FFSF33-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49 # SAT001_MinMin_p005000_rr_RG with pid 2563 completed with status 0
% 0.20/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.49 # Search class: FGUNF-FFSF33-SFFFFFNN
% 0.20/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49 # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 10
% 0.20/0.49 # Removed by relevancy pruning/SinE : 0
% 0.20/0.49 # Initial clauses : 12
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 12
% 0.20/0.49 # Processed clauses : 43
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 2
% 0.20/0.49 # ...remaining for further processing : 41
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 1
% 0.20/0.49 # Generated clauses : 43
% 0.20/0.49 # ...of the previous two non-redundant : 31
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 43
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 10
% 0.20/0.49 # ...of those cached : 4
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 28
% 0.20/0.49 # Positive orientable unit clauses : 5
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 2
% 0.20/0.49 # Non-unit-clauses : 21
% 0.20/0.49 # Current number of unprocessed clauses: 10
% 0.20/0.49 # ...number of literals in the above : 46
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 13
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 66
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 55
% 0.20/0.49 # Non-unit clause-clause subsumptions : 2
% 0.20/0.49 # Unit Clause-clause subsumption calls : 4
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 7
% 0.20/0.49 # BW rewrite match successes : 1
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 1234
% 0.20/0.49 # Search garbage collected termcells : 120
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.006 s
% 0.20/0.49 # System time : 0.001 s
% 0.20/0.49 # Total time : 0.007 s
% 0.20/0.49 # Maximum resident set size: 1732 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.008 s
% 0.20/0.49 # System time : 0.003 s
% 0.20/0.49 # Total time : 0.010 s
% 0.20/0.49 # Maximum resident set size: 1692 pages
% 0.20/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------