TSTP Solution File: CSR121^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR121^2 : TPTP v8.2.0. Released v4.1.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 : 300s
% WCLimit : 300s
% DateTime : Mon May 20 19:16:32 EDT 2024
% Result : Theorem 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 24 ( 3 unt; 7 typ; 0 def)
% Number of atoms : 79 ( 0 equ; 0 cnn)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 218 ( 38 ~; 29 |; 12 &; 139 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 7 ( 0 ^ 5 !; 2 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_37,type,
holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
thf(decl_49,type,
lBill_THFTYPE_i: $i ).
thf(decl_60,type,
lMary_THFTYPE_i: $i ).
thf(decl_72,type,
lSue_THFTYPE_i: $i ).
thf(decl_83,type,
lYearFn_THFTYPE_IiiI: $i > $i ).
thf(decl_87,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_93,type,
n2009_THFTYPE_i: $i ).
thf(ax_049,axiom,
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ~ ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_049) ).
thf(con,conjecture,
? [X5: $i] :
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X5 )
& ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
thf(c_0_2,plain,
( ( ~ ~ ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[ax_049])]) ).
thf(c_0_3,negated_conjecture,
~ ? [X5: $i] :
( ( ~ ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X5 )
& ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X5 )
& ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
thf(c_0_4,plain,
( ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) )
& ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
thf(c_0_5,negated_conjecture,
! [X130: $i] :
( ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X130 )
| ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X130 )
| ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X130 ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X130 ) )
& ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X130 )
| ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X130 )
| ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X130 ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X130 ) )
& ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X130 )
| ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X130 )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
thf(c_0_6,plain,
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X1: $i] :
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i] :
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_10,plain,
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true )
| ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_11,plain,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
inference(csr,[status(thm)],[c_0_6,c_0_7]) ).
thf(c_0_12,plain,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
inference(csr,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i] :
( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 )
| ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_14,plain,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i] :
( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 )
| ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
thf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_12]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR121^2 : TPTP v8.2.0. Released v4.1.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 01:03:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running higher-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/eprover-ho --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.21/0.51 # Version: 3.1.0-ho
% 0.21/0.51 # Preprocessing class: HSLSSMSMSSSNHFA.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.51 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.21/0.51 # Starting full_lambda_6 with 300s (1) cores
% 0.21/0.51 # Starting full_lambda_9 with 300s (1) cores
% 0.21/0.51 # full_lambda_9 with pid 7646 completed with status 0
% 0.21/0.51 # Result found by full_lambda_9
% 0.21/0.51 # Preprocessing class: HSLSSMSMSSSNHFA.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.51 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.21/0.51 # Starting full_lambda_6 with 300s (1) cores
% 0.21/0.51 # Starting full_lambda_9 with 300s (1) cores
% 0.21/0.51 # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.21/0.51 # Search class: HGHSF-FFMM21-SHFFFFBN
% 0.21/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.51 # new_ho_10 with pid 7647 completed with status 0
% 0.21/0.51 # Result found by new_ho_10
% 0.21/0.51 # Preprocessing class: HSLSSMSMSSSNHFA.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.51 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.21/0.51 # Starting full_lambda_6 with 300s (1) cores
% 0.21/0.51 # Starting full_lambda_9 with 300s (1) cores
% 0.21/0.51 # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.21/0.51 # Search class: HGHSF-FFMM21-SHFFFFBN
% 0.21/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.51 # Preprocessing time : 0.002 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Theorem
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 279
% 0.21/0.51 # Removed by relevancy pruning/SinE : 148
% 0.21/0.51 # Initial clauses : 150
% 0.21/0.51 # Removed in clause preprocessing : 7
% 0.21/0.51 # Initial clauses in saturation : 143
% 0.21/0.51 # Processed clauses : 149
% 0.21/0.51 # ...of these trivial : 3
% 0.21/0.51 # ...subsumed : 3
% 0.21/0.51 # ...remaining for further processing : 143
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 1
% 0.21/0.51 # Backward-rewritten : 1
% 0.21/0.51 # Generated clauses : 1
% 0.21/0.51 # ...of the previous two non-redundant : 1
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 2
% 0.21/0.51 # Paramodulations : 1
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 9
% 0.21/0.51 # ...of those cached : 6
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 5
% 0.21/0.51 # Positive orientable unit clauses : 3
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 0
% 0.21/0.51 # Non-unit-clauses : 2
% 0.21/0.51 # Current number of unprocessed clauses: 131
% 0.21/0.51 # ...number of literals in the above : 190
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 138
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 378
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 194
% 0.21/0.51 # Non-unit clause-clause subsumptions : 7
% 0.21/0.51 # Unit Clause-clause subsumption calls : 5
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 1
% 0.21/0.51 # BW rewrite match successes : 1
% 0.21/0.51 # Condensation attempts : 149
% 0.21/0.51 # Condensation successes : 1
% 0.21/0.51 # Termbank termtop insertions : 7546
% 0.21/0.51 # Search garbage collected termcells : 1344
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.011 s
% 0.21/0.51 # System time : 0.006 s
% 0.21/0.51 # Total time : 0.017 s
% 0.21/0.51 # Maximum resident set size: 2372 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.016 s
% 0.21/0.51 # System time : 0.008 s
% 0.21/0.51 # Total time : 0.024 s
% 0.21/0.51 # Maximum resident set size: 1924 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.51 % E exiting
%------------------------------------------------------------------------------