TSTP Solution File: REL009+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : REL009+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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:31:25 EDT 2024
% Result : Theorem 0.12s 0.36s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 21 unt; 0 def)
% Number of atoms : 32 ( 31 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 13 ( 6 ~; 2 |; 3 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 44 ( 0 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(converse_multiplicativity,axiom,
! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_multiplicativity) ).
fof(composition_distributivity,axiom,
! [X1,X2,X3] : composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',composition_distributivity) ).
fof(converse_additivity,axiom,
! [X1,X2] : converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_additivity) ).
fof(converse_idempotence,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_idempotence) ).
fof(goals,conjecture,
! [X1,X2,X3] :
( join(X1,X2) = X2
=> ( join(composition(X1,X3),composition(X2,X3)) = composition(X2,X3)
& join(composition(X3,X1),composition(X3,X2)) = composition(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(c_0_5,plain,
! [X13,X14] : converse(composition(X13,X14)) = composition(converse(X14),converse(X13)),
inference(variable_rename,[status(thm)],[converse_multiplicativity]) ).
fof(c_0_6,plain,
! [X10,X11,X12] : composition(join(X10,X11),X12) = join(composition(X10,X12),composition(X11,X12)),
inference(variable_rename,[status(thm)],[composition_distributivity]) ).
fof(c_0_7,plain,
! [X23,X24] : converse(join(X23,X24)) = join(converse(X23),converse(X24)),
inference(variable_rename,[status(thm)],[converse_additivity]) ).
cnf(c_0_8,plain,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X22] : converse(converse(X22)) = X22,
inference(variable_rename,[status(thm)],[converse_idempotence]) ).
fof(c_0_12,negated_conjecture,
~ ! [X1,X2,X3] :
( join(X1,X2) = X2
=> ( join(composition(X1,X3),composition(X2,X3)) = composition(X2,X3)
& join(composition(X3,X1),composition(X3,X2)) = composition(X3,X2) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_13,plain,
composition(converse(X1),join(converse(X2),converse(X3))) = join(composition(converse(X1),converse(X2)),composition(converse(X1),converse(X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_8]),c_0_8]),c_0_10]) ).
cnf(c_0_14,plain,
converse(converse(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,negated_conjecture,
( join(esk1_0,esk2_0) = esk2_0
& ( join(composition(esk1_0,esk3_0),composition(esk2_0,esk3_0)) != composition(esk2_0,esk3_0)
| join(composition(esk3_0,esk1_0),composition(esk3_0,esk2_0)) != composition(esk3_0,esk2_0) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
cnf(c_0_16,plain,
composition(X1,join(converse(X2),converse(X3))) = join(composition(X1,converse(X2)),composition(X1,converse(X3))),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
join(esk1_0,esk2_0) = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,plain,
composition(X1,join(converse(X2),X3)) = join(composition(X1,converse(X2)),composition(X1,X3)),
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( join(composition(esk1_0,esk3_0),composition(esk2_0,esk3_0)) != composition(esk2_0,esk3_0)
| join(composition(esk3_0,esk1_0),composition(esk3_0,esk2_0)) != composition(esk3_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
join(composition(esk1_0,X1),composition(esk2_0,X1)) = composition(esk2_0,X1),
inference(spm,[status(thm)],[c_0_9,c_0_17]) ).
cnf(c_0_21,plain,
composition(X1,join(X2,X3)) = join(composition(X1,X2),composition(X1,X3)),
inference(spm,[status(thm)],[c_0_18,c_0_14]) ).
cnf(c_0_22,negated_conjecture,
join(composition(esk3_0,esk1_0),composition(esk3_0,esk2_0)) != composition(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).
cnf(c_0_23,negated_conjecture,
join(composition(X1,esk1_0),composition(X1,esk2_0)) = composition(X1,esk2_0),
inference(spm,[status(thm)],[c_0_21,c_0_17]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : REL009+1 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.08 % Command : run_E %s %d THM
% 0.08/0.27 % Computer : n007.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 300
% 0.08/0.27 % DateTime : Mon May 20 08:32:37 EDT 2024
% 0.08/0.27 % CPUTime :
% 0.12/0.34 Running first-order theorem proving
% 0.12/0.34 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.12/0.36 # Version: 3.1.0
% 0.12/0.36 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.36 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.36 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.36 # Starting new_bool_1 with 300s (1) cores
% 0.12/0.36 # Starting sh5l with 300s (1) cores
% 0.12/0.36 # new_bool_3 with pid 14148 completed with status 0
% 0.12/0.36 # Result found by new_bool_3
% 0.12/0.36 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.36 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.36 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.36 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.36 # Search class: FUHPM-FFSF21-MFFFFFNN
% 0.12/0.36 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.36 # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 181s (1) cores
% 0.12/0.36 # H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with pid 14154 completed with status 0
% 0.12/0.36 # Result found by H----_047_B31_F1_PI_AE_R4_CS_SP_S2S
% 0.12/0.36 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.36 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.36 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.36 # Starting new_bool_3 with 300s (1) cores
% 0.12/0.36 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.36 # Search class: FUHPM-FFSF21-MFFFFFNN
% 0.12/0.36 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.36 # Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 181s (1) cores
% 0.12/0.36 # Preprocessing time : 0.001 s
% 0.12/0.36
% 0.12/0.36 # Proof found!
% 0.12/0.36 # SZS status Theorem
% 0.12/0.36 # SZS output start CNFRefutation
% See solution above
% 0.12/0.36 # Parsed axioms : 14
% 0.12/0.36 # Removed by relevancy pruning/SinE : 4
% 0.12/0.36 # Initial clauses : 11
% 0.12/0.36 # Removed in clause preprocessing : 0
% 0.12/0.36 # Initial clauses in saturation : 11
% 0.12/0.36 # Processed clauses : 101
% 0.12/0.36 # ...of these trivial : 20
% 0.12/0.36 # ...subsumed : 50
% 0.12/0.36 # ...remaining for further processing : 31
% 0.12/0.36 # Other redundant clauses eliminated : 0
% 0.12/0.36 # Clauses deleted for lack of memory : 0
% 0.12/0.36 # Backward-subsumed : 0
% 0.12/0.36 # Backward-rewritten : 7
% 0.12/0.36 # Generated clauses : 480
% 0.12/0.36 # ...of the previous two non-redundant : 380
% 0.12/0.36 # ...aggressively subsumed : 0
% 0.12/0.36 # Contextual simplify-reflections : 0
% 0.12/0.36 # Paramodulations : 480
% 0.12/0.36 # Factorizations : 0
% 0.12/0.36 # NegExts : 0
% 0.12/0.36 # Equation resolutions : 0
% 0.12/0.36 # Disequality decompositions : 0
% 0.12/0.36 # Total rewrite steps : 591
% 0.12/0.36 # ...of those cached : 324
% 0.12/0.36 # Propositional unsat checks : 0
% 0.12/0.36 # Propositional check models : 0
% 0.12/0.36 # Propositional check unsatisfiable : 0
% 0.12/0.36 # Propositional clauses : 0
% 0.12/0.36 # Propositional clauses after purity: 0
% 0.12/0.36 # Propositional unsat core size : 0
% 0.12/0.36 # Propositional preprocessing time : 0.000
% 0.12/0.36 # Propositional encoding time : 0.000
% 0.12/0.36 # Propositional solver time : 0.000
% 0.12/0.36 # Success case prop preproc time : 0.000
% 0.12/0.36 # Success case prop encoding time : 0.000
% 0.12/0.36 # Success case prop solver time : 0.000
% 0.12/0.36 # Current number of processed clauses : 24
% 0.12/0.36 # Positive orientable unit clauses : 20
% 0.12/0.36 # Positive unorientable unit clauses: 4
% 0.12/0.36 # Negative unit clauses : 0
% 0.12/0.36 # Non-unit-clauses : 0
% 0.12/0.36 # Current number of unprocessed clauses: 280
% 0.12/0.36 # ...number of literals in the above : 280
% 0.12/0.36 # Current number of archived formulas : 0
% 0.12/0.36 # Current number of archived clauses : 7
% 0.12/0.36 # Clause-clause subsumption calls (NU) : 0
% 0.12/0.36 # Rec. Clause-clause subsumption calls : 0
% 0.12/0.36 # Non-unit clause-clause subsumptions : 0
% 0.12/0.36 # Unit Clause-clause subsumption calls : 14
% 0.12/0.36 # Rewrite failures with RHS unbound : 0
% 0.12/0.36 # BW rewrite match attempts : 63
% 0.12/0.36 # BW rewrite match successes : 61
% 0.12/0.36 # Condensation attempts : 0
% 0.12/0.36 # Condensation successes : 0
% 0.12/0.36 # Termbank termtop insertions : 5765
% 0.12/0.36 # Search garbage collected termcells : 61
% 0.12/0.36
% 0.12/0.36 # -------------------------------------------------
% 0.12/0.36 # User time : 0.005 s
% 0.12/0.36 # System time : 0.001 s
% 0.12/0.36 # Total time : 0.006 s
% 0.12/0.36 # Maximum resident set size: 1760 pages
% 0.12/0.36
% 0.12/0.36 # -------------------------------------------------
% 0.12/0.36 # User time : 0.006 s
% 0.12/0.36 # System time : 0.003 s
% 0.12/0.36 # Total time : 0.008 s
% 0.12/0.36 # Maximum resident set size: 1708 pages
% 0.12/0.36 % E---3.1 exiting
% 0.12/0.36 % E exiting
%------------------------------------------------------------------------------