TSTP Solution File: SYN726+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYN726+1 : TPTP v8.2.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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 08:01:18 EDT 2024
% Result : Theorem 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 27 ( 9 unt; 0 def)
% Number of atoms : 97 ( 0 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 100 ( 30 ~; 37 |; 20 &)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 80 ( 4 sgn 48 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thm400,conjecture,
( ( ( ! [X1,X2,X3] :
( ( p(X1,X2)
& p(X2,X3) )
=> p(X1,X3) )
& ! [X1,X2,X3] :
( ( q(X1,X2)
& q(X2,X3) )
=> q(X1,X3) )
& ! [X1,X2] :
( q(X1,X2)
=> q(X2,X1) )
& ! [X1,X2] :
( p(X1,X2)
| q(X1,X2) ) )
=> ! [X1,X2] : p(X1,X2) )
| ! [X1,X2] : q(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm400) ).
fof(c_0_1,plain,
( epred1_0
<=> ( ! [X1,X2,X3] :
( ( p(X1,X2)
& p(X2,X3) )
=> p(X1,X3) )
& ! [X1,X2,X3] :
( ( q(X1,X2)
& q(X2,X3) )
=> q(X1,X3) )
& ! [X1,X2] :
( q(X1,X2)
=> q(X2,X1) )
& ! [X1,X2] :
( p(X1,X2)
| q(X1,X2) ) ) ),
introduced(definition) ).
fof(c_0_2,plain,
( epred1_0
=> ( ! [X1,X2,X3] :
( ( p(X1,X2)
& p(X2,X3) )
=> p(X1,X3) )
& ! [X1,X2,X3] :
( ( q(X1,X2)
& q(X2,X3) )
=> q(X1,X3) )
& ! [X1,X2] :
( q(X1,X2)
=> q(X2,X1) )
& ! [X1,X2] :
( p(X1,X2)
| q(X1,X2) ) ) ),
inference(split_equiv,[status(thm)],[c_0_1]) ).
fof(c_0_3,negated_conjecture,
~ ( ( epred1_0
=> ! [X1,X2] : p(X1,X2) )
| ! [X1,X2] : q(X1,X2) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[thm400]),c_0_1]) ).
fof(c_0_4,plain,
! [X8,X9,X10,X11,X12,X13,X14,X15,X16,X17] :
( ( ~ p(X8,X9)
| ~ p(X9,X10)
| p(X8,X10)
| ~ epred1_0 )
& ( ~ q(X11,X12)
| ~ q(X12,X13)
| q(X11,X13)
| ~ epred1_0 )
& ( ~ q(X14,X15)
| q(X15,X14)
| ~ epred1_0 )
& ( p(X16,X17)
| q(X16,X17)
| ~ epred1_0 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])]) ).
fof(c_0_5,negated_conjecture,
( epred1_0
& ~ p(esk1_0,esk2_0)
& ~ q(esk3_0,esk4_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_6,plain,
( p(X1,X3)
| ~ p(X1,X2)
| ~ p(X2,X3)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
epred1_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( p(X1,X2)
| q(X1,X2)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
( p(X1,X2)
| ~ p(X3,X2)
| ~ p(X1,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).
cnf(c_0_10,plain,
( q(X1,X2)
| p(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_7])]) ).
cnf(c_0_11,plain,
( q(X2,X1)
| ~ q(X1,X2)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,negated_conjecture,
~ p(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,plain,
( q(X1,X2)
| p(X3,X2)
| ~ p(X3,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( q(X1,X3)
| ~ q(X1,X2)
| ~ q(X2,X3)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,plain,
( q(X1,X2)
| ~ q(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_7])]) ).
cnf(c_0_16,negated_conjecture,
q(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_17,plain,
( q(X1,X2)
| q(X2,X3)
| p(X1,X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_18,plain,
( q(X1,X2)
| ~ q(X3,X2)
| ~ q(X1,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_7])]) ).
cnf(c_0_19,plain,
q(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( q(X1,esk2_0)
| q(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_21,plain,
( q(X1,esk1_0)
| ~ q(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
q(X1,esk1_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_20]),c_0_21]) ).
cnf(c_0_23,plain,
q(esk1_0,X1),
inference(spm,[status(thm)],[c_0_15,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
~ q(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_25,plain,
q(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_23]),c_0_22])]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN726+1 : TPTP v8.2.0. Released v2.5.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n012.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 : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 15:19:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.19/0.48 Running first-order model finding
% 0.19/0.48 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/benchmark/theBenchmark.p
% 0.19/0.49 # Version: 3.1.0
% 0.19/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # sh5l with pid 30422 completed with status 0
% 0.19/0.49 # Result found by sh5l
% 0.19/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 # Starting sh5l with 300s (1) cores
% 0.19/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.49 # Search class: FGUNF-FFSF00-SFFFFFNN
% 0.19/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.49 # SAT001_MinMin_p005000_rr_RG with pid 30429 completed with status 0
% 0.19/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.49 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.50 # Search class: FGUNF-FFSF00-SFFFFFNN
% 0.19/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.50 # Preprocessing time : 0.001 s
% 0.19/0.50 # Presaturation interreduction done
% 0.19/0.50
% 0.19/0.50 # Proof found!
% 0.19/0.50 # SZS status Theorem
% 0.19/0.50 # SZS output start CNFRefutation
% See solution above
% 0.19/0.50 # Parsed axioms : 1
% 0.19/0.50 # Removed by relevancy pruning/SinE : 0
% 0.19/0.50 # Initial clauses : 7
% 0.19/0.50 # Removed in clause preprocessing : 0
% 0.19/0.50 # Initial clauses in saturation : 7
% 0.19/0.50 # Processed clauses : 32
% 0.19/0.50 # ...of these trivial : 0
% 0.19/0.50 # ...subsumed : 1
% 0.19/0.50 # ...remaining for further processing : 31
% 0.19/0.50 # Other redundant clauses eliminated : 0
% 0.19/0.50 # Clauses deleted for lack of memory : 0
% 0.19/0.50 # Backward-subsumed : 2
% 0.19/0.50 # Backward-rewritten : 18
% 0.19/0.50 # Generated clauses : 51
% 0.19/0.50 # ...of the previous two non-redundant : 37
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 1
% 0.19/0.50 # Paramodulations : 51
% 0.19/0.50 # Factorizations : 0
% 0.19/0.50 # NegExts : 0
% 0.19/0.50 # Equation resolutions : 0
% 0.19/0.50 # Disequality decompositions : 0
% 0.19/0.50 # Total rewrite steps : 39
% 0.19/0.50 # ...of those cached : 16
% 0.19/0.50 # Propositional unsat checks : 0
% 0.19/0.50 # Propositional check models : 0
% 0.19/0.50 # Propositional check unsatisfiable : 0
% 0.19/0.50 # Propositional clauses : 0
% 0.19/0.50 # Propositional clauses after purity: 0
% 0.19/0.50 # Propositional unsat core size : 0
% 0.19/0.50 # Propositional preprocessing time : 0.000
% 0.19/0.50 # Propositional encoding time : 0.000
% 0.19/0.50 # Propositional solver time : 0.000
% 0.19/0.50 # Success case prop preproc time : 0.000
% 0.19/0.50 # Success case prop encoding time : 0.000
% 0.19/0.50 # Success case prop solver time : 0.000
% 0.19/0.50 # Current number of processed clauses : 4
% 0.19/0.50 # Positive orientable unit clauses : 2
% 0.19/0.50 # Positive unorientable unit clauses: 0
% 0.19/0.50 # Negative unit clauses : 1
% 0.19/0.50 # Non-unit-clauses : 1
% 0.19/0.50 # Current number of unprocessed clauses: 19
% 0.19/0.50 # ...number of literals in the above : 54
% 0.19/0.50 # Current number of archived formulas : 0
% 0.19/0.50 # Current number of archived clauses : 27
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 42
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 39
% 0.19/0.50 # Non-unit clause-clause subsumptions : 2
% 0.19/0.50 # Unit Clause-clause subsumption calls : 41
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 17
% 0.19/0.50 # BW rewrite match successes : 17
% 0.19/0.50 # Condensation attempts : 0
% 0.19/0.50 # Condensation successes : 0
% 0.19/0.50 # Termbank termtop insertions : 932
% 0.19/0.50 # Search garbage collected termcells : 139
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.005 s
% 0.19/0.50 # System time : 0.000 s
% 0.19/0.50 # Total time : 0.005 s
% 0.19/0.50 # Maximum resident set size: 1748 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.006 s
% 0.19/0.50 # System time : 0.003 s
% 0.19/0.50 # Total time : 0.009 s
% 0.19/0.50 # Maximum resident set size: 1688 pages
% 0.19/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------