TSTP Solution File: REL003+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : REL003+1 : TPTP v8.1.2. 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:14:00 EDT 2023
% Result : Theorem 0.17s 0.44s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 11 unt; 0 def)
% Number of atoms : 39 ( 38 equ)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 30 ( 11 ~; 10 |; 5 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 19 ( 0 sgn; 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X1,X2] :
( ( join(X1,X2) = X2
=> join(converse(X1),converse(X2)) = converse(X2) )
& ( join(converse(X1),converse(X2)) = converse(X2)
=> join(X1,X2) = X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.GUx0PCNlIA/E---3.1_27233.p',goals) ).
fof(converse_additivity,axiom,
! [X1,X2] : converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox/tmp/tmp.GUx0PCNlIA/E---3.1_27233.p',converse_additivity) ).
fof(maddux1_join_commutativity,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.GUx0PCNlIA/E---3.1_27233.p',maddux1_join_commutativity) ).
fof(converse_idempotence,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/export/starexec/sandbox/tmp/tmp.GUx0PCNlIA/E---3.1_27233.p',converse_idempotence) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2] :
( ( join(X1,X2) = X2
=> join(converse(X1),converse(X2)) = converse(X2) )
& ( join(converse(X1),converse(X2)) = converse(X2)
=> join(X1,X2) = X2 ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_5,negated_conjecture,
( ( join(converse(esk1_0),converse(esk2_0)) = converse(esk2_0)
| join(esk1_0,esk2_0) = esk2_0 )
& ( join(esk1_0,esk2_0) != esk2_0
| join(esk1_0,esk2_0) = esk2_0 )
& ( join(converse(esk1_0),converse(esk2_0)) = converse(esk2_0)
| join(converse(esk1_0),converse(esk2_0)) != converse(esk2_0) )
& ( join(esk1_0,esk2_0) != esk2_0
| join(converse(esk1_0),converse(esk2_0)) != converse(esk2_0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_6,plain,
! [X12,X13] : converse(join(X12,X13)) = join(converse(X12),converse(X13)),
inference(variable_rename,[status(thm)],[converse_additivity]) ).
cnf(c_0_7,negated_conjecture,
( join(converse(esk1_0),converse(esk2_0)) = converse(esk2_0)
| join(esk1_0,esk2_0) = esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X6,X7] : join(X6,X7) = join(X7,X6),
inference(variable_rename,[status(thm)],[maddux1_join_commutativity]) ).
cnf(c_0_10,negated_conjecture,
( join(esk1_0,esk2_0) != esk2_0
| join(converse(esk1_0),converse(esk2_0)) != converse(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_11,plain,
! [X11] : converse(converse(X11)) = X11,
inference(variable_rename,[status(thm)],[converse_idempotence]) ).
cnf(c_0_12,negated_conjecture,
( converse(join(esk1_0,esk2_0)) = converse(esk2_0)
| join(esk1_0,esk2_0) = esk2_0 ),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_13,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( converse(join(esk1_0,esk2_0)) != converse(esk2_0)
| join(esk1_0,esk2_0) != esk2_0 ),
inference(rw,[status(thm)],[c_0_10,c_0_8]) ).
cnf(c_0_15,plain,
converse(converse(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( converse(join(esk2_0,esk1_0)) = converse(esk2_0)
| join(esk2_0,esk1_0) = esk2_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( converse(join(esk2_0,esk1_0)) != converse(esk2_0)
| join(esk2_0,esk1_0) != esk2_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_13]),c_0_13]) ).
cnf(c_0_18,negated_conjecture,
join(esk2_0,esk1_0) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_15])]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : REL003+1 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n007.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 2400
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Mon Oct 2 15:05:54 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.17/0.43 Running first-order model finding
% 0.17/0.43 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.GUx0PCNlIA/E---3.1_27233.p
% 0.17/0.44 # Version: 3.1pre001
% 0.17/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.44 # Starting sh5l with 300s (1) cores
% 0.17/0.44 # new_bool_1 with pid 27312 completed with status 0
% 0.17/0.44 # Result found by new_bool_1
% 0.17/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.44 # Search class: FGHPM-FFSF21-MFFFFFNN
% 0.17/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.44 # SAT001_MinMin_p005000_rr_RG with pid 27318 completed with status 0
% 0.17/0.44 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.44 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.44 # Search class: FGHPM-FFSF21-MFFFFFNN
% 0.17/0.44 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.44 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.44 # Preprocessing time : 0.001 s
% 0.17/0.44 # Presaturation interreduction done
% 0.17/0.44
% 0.17/0.44 # Proof found!
% 0.17/0.44 # SZS status Theorem
% 0.17/0.44 # SZS output start CNFRefutation
% See solution above
% 0.17/0.44 # Parsed axioms : 14
% 0.17/0.44 # Removed by relevancy pruning/SinE : 4
% 0.17/0.44 # Initial clauses : 13
% 0.17/0.44 # Removed in clause preprocessing : 2
% 0.17/0.44 # Initial clauses in saturation : 11
% 0.17/0.44 # Processed clauses : 24
% 0.17/0.44 # ...of these trivial : 0
% 0.17/0.44 # ...subsumed : 0
% 0.17/0.44 # ...remaining for further processing : 24
% 0.17/0.44 # Other redundant clauses eliminated : 0
% 0.17/0.44 # Clauses deleted for lack of memory : 0
% 0.17/0.44 # Backward-subsumed : 0
% 0.17/0.44 # Backward-rewritten : 6
% 0.17/0.44 # Generated clauses : 21
% 0.17/0.44 # ...of the previous two non-redundant : 21
% 0.17/0.44 # ...aggressively subsumed : 0
% 0.17/0.44 # Contextual simplify-reflections : 0
% 0.17/0.44 # Paramodulations : 21
% 0.17/0.44 # Factorizations : 0
% 0.17/0.44 # NegExts : 0
% 0.17/0.44 # Equation resolutions : 0
% 0.17/0.44 # Total rewrite steps : 27
% 0.17/0.44 # Propositional unsat checks : 0
% 0.17/0.44 # Propositional check models : 0
% 0.17/0.44 # Propositional check unsatisfiable : 0
% 0.17/0.44 # Propositional clauses : 0
% 0.17/0.44 # Propositional clauses after purity: 0
% 0.17/0.44 # Propositional unsat core size : 0
% 0.17/0.44 # Propositional preprocessing time : 0.000
% 0.17/0.44 # Propositional encoding time : 0.000
% 0.17/0.44 # Propositional solver time : 0.000
% 0.17/0.44 # Success case prop preproc time : 0.000
% 0.17/0.44 # Success case prop encoding time : 0.000
% 0.17/0.44 # Success case prop solver time : 0.000
% 0.17/0.44 # Current number of processed clauses : 7
% 0.17/0.44 # Positive orientable unit clauses : 6
% 0.17/0.44 # Positive unorientable unit clauses: 1
% 0.17/0.44 # Negative unit clauses : 0
% 0.17/0.44 # Non-unit-clauses : 0
% 0.17/0.44 # Current number of unprocessed clauses: 19
% 0.17/0.44 # ...number of literals in the above : 23
% 0.17/0.44 # Current number of archived formulas : 0
% 0.17/0.44 # Current number of archived clauses : 17
% 0.17/0.44 # Clause-clause subsumption calls (NU) : 0
% 0.17/0.44 # Rec. Clause-clause subsumption calls : 0
% 0.17/0.44 # Non-unit clause-clause subsumptions : 0
% 0.17/0.44 # Unit Clause-clause subsumption calls : 2
% 0.17/0.44 # Rewrite failures with RHS unbound : 0
% 0.17/0.44 # BW rewrite match attempts : 10
% 0.17/0.44 # BW rewrite match successes : 10
% 0.17/0.44 # Condensation attempts : 0
% 0.17/0.44 # Condensation successes : 0
% 0.17/0.44 # Termbank termtop insertions : 875
% 0.17/0.44
% 0.17/0.44 # -------------------------------------------------
% 0.17/0.44 # User time : 0.005 s
% 0.17/0.44 # System time : 0.000 s
% 0.17/0.44 # Total time : 0.005 s
% 0.17/0.44 # Maximum resident set size: 1752 pages
% 0.17/0.44
% 0.17/0.44 # -------------------------------------------------
% 0.17/0.44 # User time : 0.005 s
% 0.17/0.44 # System time : 0.003 s
% 0.17/0.44 # Total time : 0.007 s
% 0.17/0.44 # Maximum resident set size: 1680 pages
% 0.17/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------