TSTP Solution File: SEU344+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU344+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n011.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 : 600s
% DateTime : Tue Jul 19 09:19:11 EDT 2022
% Result : Theorem 0.23s 1.40s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 10 unt; 0 def)
% Number of atoms : 103 ( 16 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 111 ( 44 ~; 40 |; 13 &)
% ( 3 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 51 ( 6 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t2_lattice3,conjecture,
! [X1,X2] :
( element(X2,the_carrier(boole_lattice(X1)))
=> ! [X3] :
( element(X3,the_carrier(boole_lattice(X1)))
=> ( below(boole_lattice(X1),X2,X3)
<=> subset(X2,X3) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_lattice3) ).
fof(d3_lattices,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& join_semilatt_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( below(X1,X2,X3)
<=> join(X1,X2,X3) = X3 ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_lattices) ).
fof(fc1_lattice3,axiom,
! [X1] :
( ~ empty_carrier(boole_lattice(X1))
& strict_latt_str(boole_lattice(X1)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc1_lattice3) ).
fof(t1_lattice3,axiom,
! [X1,X2] :
( element(X2,the_carrier(boole_lattice(X1)))
=> ! [X3] :
( element(X3,the_carrier(boole_lattice(X1)))
=> ( join(boole_lattice(X1),X2,X3) = set_union2(X2,X3)
& meet(boole_lattice(X1),X2,X3) = set_intersection2(X2,X3) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t1_lattice3) ).
fof(t12_xboole_1,axiom,
! [X1,X2] :
( subset(X1,X2)
=> set_union2(X1,X2) = X2 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t12_xboole_1) ).
fof(t7_xboole_1,axiom,
! [X1,X2] : subset(X1,set_union2(X1,X2)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t7_xboole_1) ).
fof(dt_l3_lattices,axiom,
! [X1] :
( latt_str(X1)
=> ( meet_semilatt_str(X1)
& join_semilatt_str(X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_l3_lattices) ).
fof(dt_k1_lattice3,axiom,
! [X1] :
( strict_latt_str(boole_lattice(X1))
& latt_str(boole_lattice(X1)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k1_lattice3) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2] :
( element(X2,the_carrier(boole_lattice(X1)))
=> ! [X3] :
( element(X3,the_carrier(boole_lattice(X1)))
=> ( below(boole_lattice(X1),X2,X3)
<=> subset(X2,X3) ) ) ),
inference(assume_negation,[status(cth)],[t2_lattice3]) ).
fof(c_0_9,negated_conjecture,
( element(esk2_0,the_carrier(boole_lattice(esk1_0)))
& element(esk3_0,the_carrier(boole_lattice(esk1_0)))
& ( ~ below(boole_lattice(esk1_0),esk2_0,esk3_0)
| ~ subset(esk2_0,esk3_0) )
& ( below(boole_lattice(esk1_0),esk2_0,esk3_0)
| subset(esk2_0,esk3_0) ) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])]) ).
fof(c_0_10,plain,
! [X4,X5,X6] :
( ( ~ below(X4,X5,X6)
| join(X4,X5,X6) = X6
| ~ element(X6,the_carrier(X4))
| ~ element(X5,the_carrier(X4))
| empty_carrier(X4)
| ~ join_semilatt_str(X4) )
& ( join(X4,X5,X6) != X6
| below(X4,X5,X6)
| ~ element(X6,the_carrier(X4))
| ~ element(X5,the_carrier(X4))
| empty_carrier(X4)
| ~ join_semilatt_str(X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[d3_lattices])])])])])])]) ).
fof(c_0_11,plain,
! [X2,X2] :
( ~ empty_carrier(boole_lattice(X2))
& strict_latt_str(boole_lattice(X2)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[fc1_lattice3])])])]) ).
cnf(c_0_12,negated_conjecture,
( ~ subset(esk2_0,esk3_0)
| ~ below(boole_lattice(esk1_0),esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( empty_carrier(X1)
| below(X1,X2,X3)
| ~ join_semilatt_str(X1)
| ~ element(X2,the_carrier(X1))
| ~ element(X3,the_carrier(X1))
| join(X1,X2,X3) != X3 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
element(esk3_0,the_carrier(boole_lattice(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
element(esk2_0,the_carrier(boole_lattice(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
~ empty_carrier(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X4,X5,X6] :
( ( join(boole_lattice(X4),X5,X6) = set_union2(X5,X6)
| ~ element(X6,the_carrier(boole_lattice(X4)))
| ~ element(X5,the_carrier(boole_lattice(X4))) )
& ( meet(boole_lattice(X4),X5,X6) = set_intersection2(X5,X6)
| ~ element(X6,the_carrier(boole_lattice(X4)))
| ~ element(X5,the_carrier(boole_lattice(X4))) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_lattice3])])])])])]) ).
fof(c_0_18,plain,
! [X3,X4] :
( ~ subset(X3,X4)
| set_union2(X3,X4) = X4 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_xboole_1])]) ).
cnf(c_0_19,negated_conjecture,
( join(boole_lattice(esk1_0),esk2_0,esk3_0) != esk3_0
| ~ subset(esk2_0,esk3_0)
| ~ join_semilatt_str(boole_lattice(esk1_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15])]),c_0_16]) ).
cnf(c_0_20,plain,
( join(boole_lattice(X2),X1,X3) = set_union2(X1,X3)
| ~ element(X1,the_carrier(boole_lattice(X2)))
| ~ element(X3,the_carrier(boole_lattice(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,plain,
( set_union2(X1,X2) = X2
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
( empty_carrier(X1)
| join(X1,X2,X3) = X3
| ~ join_semilatt_str(X1)
| ~ element(X2,the_carrier(X1))
| ~ element(X3,the_carrier(X1))
| ~ below(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_23,negated_conjecture,
( subset(esk2_0,esk3_0)
| below(boole_lattice(esk1_0),esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,negated_conjecture,
( ~ subset(esk2_0,esk3_0)
| ~ join_semilatt_str(boole_lattice(esk1_0)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_14]),c_0_15])]),c_0_21]) ).
fof(c_0_25,plain,
! [X3,X4] : subset(X3,set_union2(X3,X4)),
inference(variable_rename,[status(thm)],[t7_xboole_1]) ).
cnf(c_0_26,negated_conjecture,
( join(boole_lattice(esk1_0),esk2_0,esk3_0) = esk3_0
| ~ join_semilatt_str(boole_lattice(esk1_0)) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_14]),c_0_15])]),c_0_16]),c_0_24]) ).
fof(c_0_27,plain,
! [X2] :
( ( meet_semilatt_str(X2)
| ~ latt_str(X2) )
& ( join_semilatt_str(X2)
| ~ latt_str(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l3_lattices])])]) ).
fof(c_0_28,plain,
! [X2,X2] :
( strict_latt_str(boole_lattice(X2))
& latt_str(boole_lattice(X2)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[dt_k1_lattice3])])]) ).
cnf(c_0_29,plain,
subset(X1,set_union2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,negated_conjecture,
( set_union2(esk2_0,esk3_0) = esk3_0
| ~ join_semilatt_str(boole_lattice(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_26]),c_0_14]),c_0_15])]) ).
cnf(c_0_31,plain,
( join_semilatt_str(X1)
| ~ latt_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,plain,
latt_str(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,negated_conjecture,
~ join_semilatt_str(boole_lattice(esk1_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_24]) ).
cnf(c_0_34,plain,
join_semilatt_str(boole_lattice(X1)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU344+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n011.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 20 11:19:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.23/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.40 # Preprocessing time : 0.019 s
% 0.23/1.40
% 0.23/1.40 # Proof found!
% 0.23/1.40 # SZS status Theorem
% 0.23/1.40 # SZS output start CNFRefutation
% See solution above
% 0.23/1.40 # Proof object total steps : 36
% 0.23/1.40 # Proof object clause steps : 19
% 0.23/1.40 # Proof object formula steps : 17
% 0.23/1.40 # Proof object conjectures : 13
% 0.23/1.40 # Proof object clause conjectures : 10
% 0.23/1.40 # Proof object formula conjectures : 3
% 0.23/1.40 # Proof object initial clauses used : 12
% 0.23/1.40 # Proof object initial formulas used : 8
% 0.23/1.40 # Proof object generating inferences : 6
% 0.23/1.40 # Proof object simplifying inferences : 19
% 0.23/1.40 # Training examples: 0 positive, 0 negative
% 0.23/1.40 # Parsed axioms : 81
% 0.23/1.40 # Removed by relevancy pruning/SinE : 27
% 0.23/1.40 # Initial clauses : 79
% 0.23/1.40 # Removed in clause preprocessing : 0
% 0.23/1.40 # Initial clauses in saturation : 79
% 0.23/1.40 # Processed clauses : 94
% 0.23/1.40 # ...of these trivial : 1
% 0.23/1.40 # ...subsumed : 1
% 0.23/1.40 # ...remaining for further processing : 92
% 0.23/1.40 # Other redundant clauses eliminated : 0
% 0.23/1.40 # Clauses deleted for lack of memory : 0
% 0.23/1.40 # Backward-subsumed : 1
% 0.23/1.40 # Backward-rewritten : 11
% 0.23/1.40 # Generated clauses : 76
% 0.23/1.40 # ...of the previous two non-trivial : 62
% 0.23/1.40 # Contextual simplify-reflections : 4
% 0.23/1.40 # Paramodulations : 73
% 0.23/1.40 # Factorizations : 0
% 0.23/1.40 # Equation resolutions : 3
% 0.23/1.40 # Current number of processed clauses : 80
% 0.23/1.40 # Positive orientable unit clauses : 27
% 0.23/1.40 # Positive unorientable unit clauses: 2
% 0.23/1.40 # Negative unit clauses : 6
% 0.23/1.40 # Non-unit-clauses : 45
% 0.23/1.40 # Current number of unprocessed clauses: 39
% 0.23/1.40 # ...number of literals in the above : 145
% 0.23/1.40 # Current number of archived formulas : 0
% 0.23/1.40 # Current number of archived clauses : 12
% 0.23/1.40 # Clause-clause subsumption calls (NU) : 793
% 0.23/1.40 # Rec. Clause-clause subsumption calls : 204
% 0.23/1.40 # Non-unit clause-clause subsumptions : 6
% 0.23/1.40 # Unit Clause-clause subsumption calls : 181
% 0.23/1.40 # Rewrite failures with RHS unbound : 0
% 0.23/1.40 # BW rewrite match attempts : 14
% 0.23/1.40 # BW rewrite match successes : 13
% 0.23/1.40 # Condensation attempts : 0
% 0.23/1.40 # Condensation successes : 0
% 0.23/1.40 # Termbank termtop insertions : 6280
% 0.23/1.40
% 0.23/1.40 # -------------------------------------------------
% 0.23/1.40 # User time : 0.019 s
% 0.23/1.40 # System time : 0.006 s
% 0.23/1.40 # Total time : 0.025 s
% 0.23/1.40 # Maximum resident set size: 3460 pages
% 0.23/23.40 eprover: CPU time limit exceeded, terminating
% 0.23/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.42 eprover: No such file or directory
% 0.23/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.42 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
%------------------------------------------------------------------------------