TSTP Solution File: AGT003+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : AGT003+2 : TPTP v8.1.2. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 16:59:15 EDT 2023
% Result : Theorem 0.19s 0.54s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 15 ( 10 unt; 0 def)
% Number of atoms : 33 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 32 ( 14 ~; 12 |; 5 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 15 ( 0 sgn; 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(a1_1,axiom,
! [X1,X2,X3,X4] :
( accept_team(X1,X4,X2,X3)
<=> ( accept_city(X1,X2)
& accept_leader(X1,X4)
& accept_number(X1,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.PajRcNfIrd/E---3.1_720.p',a1_1) ).
fof(deduced_164,axiom,
accept_number(christiansufferterrahumanitarianorganization,n5),
file('/export/starexec/sandbox2/tmp/tmp.PajRcNfIrd/E---3.1_720.p',deduced_164) ).
fof(deduced_84,axiom,
accept_leader(christiansufferterrahumanitarianorganization,countryafirstaidorganization),
file('/export/starexec/sandbox2/tmp/tmp.PajRcNfIrd/E---3.1_720.p',deduced_84) ).
fof(query_3,conjecture,
accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5),
file('/export/starexec/sandbox2/tmp/tmp.PajRcNfIrd/E---3.1_720.p',query_3) ).
fof(deduced_83,axiom,
accept_city(christiansufferterrahumanitarianorganization,towna),
file('/export/starexec/sandbox2/tmp/tmp.PajRcNfIrd/E---3.1_720.p',deduced_83) ).
fof(c_0_5,plain,
! [X18,X19,X20,X21] :
( ( accept_city(X18,X19)
| ~ accept_team(X18,X21,X19,X20) )
& ( accept_leader(X18,X21)
| ~ accept_team(X18,X21,X19,X20) )
& ( accept_number(X18,X20)
| ~ accept_team(X18,X21,X19,X20) )
& ( ~ accept_city(X18,X19)
| ~ accept_leader(X18,X21)
| ~ accept_number(X18,X20)
| accept_team(X18,X21,X19,X20) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a1_1])])]) ).
cnf(c_0_6,plain,
( accept_team(X1,X3,X2,X4)
| ~ accept_city(X1,X2)
| ~ accept_leader(X1,X3)
| ~ accept_number(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_7,plain,
accept_number(christiansufferterrahumanitarianorganization,n5),
inference(split_conjunct,[status(thm)],[deduced_164]) ).
cnf(c_0_8,plain,
( accept_team(christiansufferterrahumanitarianorganization,X1,X2,n5)
| ~ accept_leader(christiansufferterrahumanitarianorganization,X1)
| ~ accept_city(christiansufferterrahumanitarianorganization,X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
accept_leader(christiansufferterrahumanitarianorganization,countryafirstaidorganization),
inference(split_conjunct,[status(thm)],[deduced_84]) ).
fof(c_0_10,negated_conjecture,
~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[query_3])]) ).
cnf(c_0_11,plain,
( accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,X1,n5)
| ~ accept_city(christiansufferterrahumanitarianorganization,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
accept_city(christiansufferterrahumanitarianorganization,towna),
inference(split_conjunct,[status(thm)],[deduced_83]) ).
cnf(c_0_13,negated_conjecture,
~ accept_team(christiansufferterrahumanitarianorganization,countryafirstaidorganization,towna,n5),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : AGT003+2 : TPTP v8.1.2. Bugfixed v3.1.0.
% 0.09/0.15 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 22:05:23 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.19/0.49 Running first-order theorem proving
% 0.19/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.PajRcNfIrd/E---3.1_720.p
% 0.19/0.54 # Version: 3.1pre001
% 0.19/0.54 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.19/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.19/0.54 # Starting new_bool_3 with 600s (2) cores
% 0.19/0.54 # Starting new_bool_1 with 600s (2) cores
% 0.19/0.54 # Starting sh5l with 300s (1) cores
% 0.19/0.54 # new_bool_1 with pid 809 completed with status 0
% 0.19/0.54 # Result found by new_bool_1
% 0.19/0.54 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.19/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.19/0.54 # Starting new_bool_3 with 600s (2) cores
% 0.19/0.54 # Starting new_bool_1 with 600s (2) cores
% 0.19/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.54 # Search class: FHUNF-FSLM11-SFFFFFNN
% 0.19/0.54 # partial match(2): FGUNF-FSLF11-SFFFFFNN
% 0.19/0.54 # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.19/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 225s (1) cores
% 0.19/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2S with 94s (1) cores
% 0.19/0.54 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 811 completed with status 0
% 0.19/0.54 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.19/0.54 # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.19/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.54 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.19/0.54 # Starting new_bool_3 with 600s (2) cores
% 0.19/0.54 # Starting new_bool_1 with 600s (2) cores
% 0.19/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.54 # Search class: FHUNF-FSLM11-SFFFFFNN
% 0.19/0.54 # partial match(2): FGUNF-FSLF11-SFFFFFNN
% 0.19/0.54 # Scheduled 5 strats onto 2 cores with 600 seconds (600 total)
% 0.19/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 225s (1) cores
% 0.19/0.54 # Preprocessing time : 0.003 s
% 0.19/0.54 # Presaturation interreduction done
% 0.19/0.54
% 0.19/0.54 # Proof found!
% 0.19/0.54 # SZS status Theorem
% 0.19/0.54 # SZS output start CNFRefutation
% See solution above
% 0.19/0.54 # Parsed axioms : 923
% 0.19/0.54 # Removed by relevancy pruning/SinE : 442
% 0.19/0.54 # Initial clauses : 484
% 0.19/0.54 # Removed in clause preprocessing : 0
% 0.19/0.54 # Initial clauses in saturation : 484
% 0.19/0.54 # Processed clauses : 939
% 0.19/0.54 # ...of these trivial : 37
% 0.19/0.54 # ...subsumed : 0
% 0.19/0.54 # ...remaining for further processing : 902
% 0.19/0.54 # Other redundant clauses eliminated : 0
% 0.19/0.54 # Clauses deleted for lack of memory : 0
% 0.19/0.54 # Backward-subsumed : 0
% 0.19/0.54 # Backward-rewritten : 0
% 0.19/0.54 # Generated clauses : 436
% 0.19/0.54 # ...of the previous two non-redundant : 93
% 0.19/0.54 # ...aggressively subsumed : 0
% 0.19/0.54 # Contextual simplify-reflections : 0
% 0.19/0.54 # Paramodulations : 436
% 0.19/0.54 # Factorizations : 0
% 0.19/0.54 # NegExts : 0
% 0.19/0.54 # Equation resolutions : 0
% 0.19/0.54 # Total rewrite steps : 378
% 0.19/0.54 # Propositional unsat checks : 0
% 0.19/0.54 # Propositional check models : 0
% 0.19/0.54 # Propositional check unsatisfiable : 0
% 0.19/0.54 # Propositional clauses : 0
% 0.19/0.54 # Propositional clauses after purity: 0
% 0.19/0.54 # Propositional unsat core size : 0
% 0.19/0.54 # Propositional preprocessing time : 0.000
% 0.19/0.54 # Propositional encoding time : 0.000
% 0.19/0.54 # Propositional solver time : 0.000
% 0.19/0.54 # Success case prop preproc time : 0.000
% 0.19/0.54 # Success case prop encoding time : 0.000
% 0.19/0.54 # Success case prop solver time : 0.000
% 0.19/0.54 # Current number of processed clauses : 455
% 0.19/0.54 # Positive orientable unit clauses : 400
% 0.19/0.54 # Positive unorientable unit clauses: 0
% 0.19/0.54 # Negative unit clauses : 46
% 0.19/0.54 # Non-unit-clauses : 9
% 0.19/0.54 # Current number of unprocessed clauses: 83
% 0.19/0.54 # ...number of literals in the above : 228
% 0.19/0.54 # Current number of archived formulas : 0
% 0.19/0.54 # Current number of archived clauses : 447
% 0.19/0.54 # Clause-clause subsumption calls (NU) : 18
% 0.19/0.54 # Rec. Clause-clause subsumption calls : 18
% 0.19/0.54 # Non-unit clause-clause subsumptions : 0
% 0.19/0.54 # Unit Clause-clause subsumption calls : 510
% 0.19/0.54 # Rewrite failures with RHS unbound : 0
% 0.19/0.54 # BW rewrite match attempts : 440
% 0.19/0.54 # BW rewrite match successes : 0
% 0.19/0.54 # Condensation attempts : 0
% 0.19/0.54 # Condensation successes : 0
% 0.19/0.54 # Termbank termtop insertions : 17051
% 0.19/0.54
% 0.19/0.54 # -------------------------------------------------
% 0.19/0.54 # User time : 0.025 s
% 0.19/0.54 # System time : 0.005 s
% 0.19/0.54 # Total time : 0.030 s
% 0.19/0.54 # Maximum resident set size: 3280 pages
% 0.19/0.54
% 0.19/0.54 # -------------------------------------------------
% 0.19/0.54 # User time : 0.053 s
% 0.19/0.54 # System time : 0.011 s
% 0.19/0.54 # Total time : 0.064 s
% 0.19/0.54 # Maximum resident set size: 2296 pages
% 0.19/0.54 % E---3.1 exiting
% 0.19/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------