TSTP Solution File: REL008+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : REL008+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:14:04 EDT 2023
% Result : Theorem 0.19s 0.52s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 24 unt; 0 def)
% Number of atoms : 24 ( 23 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 5 ( 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 : 49 ( 0 sgn; 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(converse_multiplicativity,axiom,
! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox2/tmp/tmp.9DNVBOJrFr/E---3.1_28245.p',converse_multiplicativity) ).
fof(converse_idempotence,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.9DNVBOJrFr/E---3.1_28245.p',converse_idempotence) ).
fof(converse_additivity,axiom,
! [X1,X2] : converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox2/tmp/tmp.9DNVBOJrFr/E---3.1_28245.p',converse_additivity) ).
fof(composition_distributivity,axiom,
! [X1,X2,X3] : composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.9DNVBOJrFr/E---3.1_28245.p',composition_distributivity) ).
fof(goals,conjecture,
! [X1,X2,X3] : composition(X1,join(X2,X3)) = join(composition(X1,X2),composition(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.9DNVBOJrFr/E---3.1_28245.p',goals) ).
fof(c_0_5,plain,
! [X18,X19] : converse(composition(X18,X19)) = composition(converse(X19),converse(X18)),
inference(variable_rename,[status(thm)],[converse_multiplicativity]) ).
fof(c_0_6,plain,
! [X20] : converse(converse(X20)) = X20,
inference(variable_rename,[status(thm)],[converse_idempotence]) ).
fof(c_0_7,plain,
! [X21,X22] : converse(join(X21,X22)) = join(converse(X21),converse(X22)),
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,
converse(converse(X1)) = X1,
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,
! [X12,X13,X14] : composition(join(X12,X13),X14) = join(composition(X12,X14),composition(X13,X14)),
inference(variable_rename,[status(thm)],[composition_distributivity]) ).
cnf(c_0_12,plain,
converse(composition(X1,converse(X2))) = composition(X2,converse(X1)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
converse(join(converse(X1),X2)) = join(X1,converse(X2)),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_14,plain,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
join(composition(X1,converse(X2)),converse(X3)) = converse(join(composition(X2,converse(X1)),X3)),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_16,plain,
composition(join(X1,converse(X2)),converse(X3)) = converse(composition(X3,join(converse(X1),X2))),
inference(spm,[status(thm)],[c_0_8,c_0_13]) ).
fof(c_0_17,negated_conjecture,
~ ! [X1,X2,X3] : composition(X1,join(X2,X3)) = join(composition(X1,X2),composition(X1,X3)),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_18,plain,
converse(join(composition(X1,converse(X2)),composition(X1,X3))) = converse(composition(X1,join(converse(X2),X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_8]),c_0_15]),c_0_16]) ).
fof(c_0_19,negated_conjecture,
composition(esk1_0,join(esk2_0,esk3_0)) != join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])]) ).
cnf(c_0_20,plain,
join(composition(X1,converse(X2)),composition(X1,X3)) = composition(X1,join(converse(X2),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_18]),c_0_9]) ).
cnf(c_0_21,negated_conjecture,
composition(esk1_0,join(esk2_0,esk3_0)) != join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_22,plain,
join(composition(X1,X2),composition(X1,X3)) = composition(X1,join(X2,X3)),
inference(spm,[status(thm)],[c_0_20,c_0_9]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : REL008+3 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 15:33:44 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.19/0.48 Running first-order model finding
% 0.19/0.48 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.9DNVBOJrFr/E---3.1_28245.p
% 0.19/0.52 # Version: 3.1pre001
% 0.19/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.52 # Starting sh5l with 300s (1) cores
% 0.19/0.52 # new_bool_1 with pid 28324 completed with status 0
% 0.19/0.52 # Result found by new_bool_1
% 0.19/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.52 # Search class: FUUPM-FFMF21-DFFFFFNN
% 0.19/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.52 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 181s (1) cores
% 0.19/0.52 # H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with pid 28328 completed with status 0
% 0.19/0.52 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 0.19/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.52 # Search class: FUUPM-FFMF21-DFFFFFNN
% 0.19/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.52 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 181s (1) cores
% 0.19/0.52 # Preprocessing time : 0.001 s
% 0.19/0.52 # Presaturation interreduction done
% 0.19/0.52
% 0.19/0.52 # Proof found!
% 0.19/0.52 # SZS status Theorem
% 0.19/0.52 # SZS output start CNFRefutation
% See solution above
% 0.19/0.52 # Parsed axioms : 17
% 0.19/0.52 # Removed by relevancy pruning/SinE : 3
% 0.19/0.52 # Initial clauses : 14
% 0.19/0.52 # Removed in clause preprocessing : 0
% 0.19/0.52 # Initial clauses in saturation : 14
% 0.19/0.52 # Processed clauses : 189
% 0.19/0.52 # ...of these trivial : 63
% 0.19/0.52 # ...subsumed : 50
% 0.19/0.52 # ...remaining for further processing : 76
% 0.19/0.52 # Other redundant clauses eliminated : 0
% 0.19/0.52 # Clauses deleted for lack of memory : 0
% 0.19/0.52 # Backward-subsumed : 0
% 0.19/0.52 # Backward-rewritten : 4
% 0.19/0.52 # Generated clauses : 1523
% 0.19/0.52 # ...of the previous two non-redundant : 1256
% 0.19/0.52 # ...aggressively subsumed : 0
% 0.19/0.52 # Contextual simplify-reflections : 0
% 0.19/0.52 # Paramodulations : 1523
% 0.19/0.52 # Factorizations : 0
% 0.19/0.52 # NegExts : 0
% 0.19/0.52 # Equation resolutions : 0
% 0.19/0.52 # Total rewrite steps : 1520
% 0.19/0.52 # Propositional unsat checks : 0
% 0.19/0.52 # Propositional check models : 0
% 0.19/0.52 # Propositional check unsatisfiable : 0
% 0.19/0.52 # Propositional clauses : 0
% 0.19/0.52 # Propositional clauses after purity: 0
% 0.19/0.52 # Propositional unsat core size : 0
% 0.19/0.52 # Propositional preprocessing time : 0.000
% 0.19/0.52 # Propositional encoding time : 0.000
% 0.19/0.52 # Propositional solver time : 0.000
% 0.19/0.52 # Success case prop preproc time : 0.000
% 0.19/0.52 # Success case prop encoding time : 0.000
% 0.19/0.52 # Success case prop solver time : 0.000
% 0.19/0.52 # Current number of processed clauses : 58
% 0.19/0.52 # Positive orientable unit clauses : 53
% 0.19/0.52 # Positive unorientable unit clauses: 5
% 0.19/0.52 # Negative unit clauses : 0
% 0.19/0.52 # Non-unit-clauses : 0
% 0.19/0.52 # Current number of unprocessed clauses: 1087
% 0.19/0.52 # ...number of literals in the above : 1087
% 0.19/0.52 # Current number of archived formulas : 0
% 0.19/0.52 # Current number of archived clauses : 18
% 0.19/0.52 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.52 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.52 # Non-unit clause-clause subsumptions : 0
% 0.19/0.52 # Unit Clause-clause subsumption calls : 9
% 0.19/0.52 # Rewrite failures with RHS unbound : 0
% 0.19/0.52 # BW rewrite match attempts : 56
% 0.19/0.52 # BW rewrite match successes : 31
% 0.19/0.52 # Condensation attempts : 0
% 0.19/0.52 # Condensation successes : 0
% 0.19/0.52 # Termbank termtop insertions : 20424
% 0.19/0.52
% 0.19/0.52 # -------------------------------------------------
% 0.19/0.52 # User time : 0.022 s
% 0.19/0.52 # System time : 0.002 s
% 0.19/0.52 # Total time : 0.024 s
% 0.19/0.52 # Maximum resident set size: 1752 pages
% 0.19/0.52
% 0.19/0.52 # -------------------------------------------------
% 0.19/0.52 # User time : 0.024 s
% 0.19/0.52 # System time : 0.004 s
% 0.19/0.52 # Total time : 0.028 s
% 0.19/0.52 # Maximum resident set size: 1688 pages
% 0.19/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------