TSTP Solution File: PUZ001+2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : PUZ001+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n018.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 : Mon Jul 18 18:10:55 EDT 2022
% Result : Theorem 0.19s 0.38s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PUZ001+2 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34 % Computer : n018.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 : 600
% 0.13/0.34 % DateTime : Sun May 29 00:38:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.37 # No SInE strategy applied
% 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.37 #
% 0.19/0.37 # Presaturation interreduction done
% 0.19/0.37 # Number of axioms: 15 Number of unprocessed: 15
% 0.19/0.37 # Tableaux proof search.
% 0.19/0.37 # APR header successfully linked.
% 0.19/0.37 # Hello from C++
% 0.19/0.37 # The folding up rule is enabled...
% 0.19/0.37 # Local unification is enabled...
% 0.19/0.37 # Any saturation attempts will use folding labels...
% 0.19/0.37 # 15 beginning clauses after preprocessing and clausification
% 0.19/0.37 # Creating start rules for all 1 conjectures.
% 0.19/0.37 # There are 1 start rule candidates:
% 0.19/0.37 # Found 7 unit axioms.
% 0.19/0.37 # 1 start rule tableaux created.
% 0.19/0.37 # 8 extension rule candidate clauses
% 0.19/0.37 # 7 unit axiom clauses
% 0.19/0.37
% 0.19/0.37 # Requested 8, 32 cores available to the main process.
% 0.19/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.19/0.37 # Creating equality axioms
% 0.19/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.19/0.37 # Returning from population with 18 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.37 # We now have 18 tableaux to operate on
% 0.19/0.38 # There were 1 total branch saturation attempts.
% 0.19/0.38 # There were 0 of these attempts blocked.
% 0.19/0.38 # There were 0 deferred branch saturation attempts.
% 0.19/0.38 # There were 0 free duplicated saturations.
% 0.19/0.38 # There were 1 total successful branch saturations.
% 0.19/0.38 # There were 0 successful branch saturations in interreduction.
% 0.19/0.38 # There were 0 successful branch saturations on the branch.
% 0.19/0.38 # There were 1 successful branch saturations after the branch.
% 0.19/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.38 # Begin clausification derivation
% 0.19/0.38
% 0.19/0.38 # End clausification derivation
% 0.19/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.38 cnf(i_0_12, plain, (predicate2(esk3_0,kill,esk1_0,'AuntAgatha'))).
% 0.19/0.38 cnf(i_0_14, plain, (predicate1(esk2_0,live,esk1_0))).
% 0.19/0.38 cnf(i_0_13, plain, (modifier_pp(esk2_0,in,'DreadburyMansion'))).
% 0.19/0.38 cnf(i_0_1, plain, ('Butler'!='AuntAgatha')).
% 0.19/0.38 cnf(i_0_15, negated_conjecture, (~predicate2(X1,kill,'AuntAgatha','AuntAgatha'))).
% 0.19/0.38 cnf(i_0_7, plain, (~predicate2(X1,hate,'AuntAgatha','Butler'))).
% 0.19/0.38 cnf(i_0_2, plain, (~predicate2(X1,hate,X2,esk9_1(X2)))).
% 0.19/0.38 cnf(i_0_8, plain, (~predicate2(X1,hate,'Charles',X2)|~predicate2(X3,hate,'AuntAgatha',X2))).
% 0.19/0.38 cnf(i_0_9, plain, (~property2(X1,rich,comp_than,X2)|~predicate2(X3,kill,X1,X2))).
% 0.19/0.38 cnf(i_0_6, plain, (X1='Butler'|predicate2(esk5_1(X1),hate,'AuntAgatha',X1))).
% 0.19/0.38 cnf(i_0_4, plain, (esk6_1(X1)=X1|predicate2(esk7_1(X1),hate,'Butler',X1))).
% 0.19/0.38 cnf(i_0_3, plain, (predicate2(esk8_2(X1,X2),hate,'Butler',X1)|~predicate2(X2,hate,'AuntAgatha',X1))).
% 0.19/0.38 cnf(i_0_10, plain, (predicate2(esk4_3(X1,X2,X3),hate,X1,X2)|~predicate2(X3,kill,X1,X2))).
% 0.19/0.38 cnf(i_0_11, plain, (X1='Charles'|X1='Butler'|X1='AuntAgatha'|~modifier_pp(X2,in,'DreadburyMansion')|~predicate1(X2,live,X1))).
% 0.19/0.38 cnf(i_0_5, plain, (property2(esk6_1(X1),rich,comp_than,'AuntAgatha')|predicate2(esk7_1(X1),hate,'Butler',X1))).
% 0.19/0.38 cnf(i_0_37, plain, (X58=X58)).
% 0.19/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.38 # Begin printing tableau
% 0.19/0.38 # Found 4 steps
% 0.19/0.38 cnf(i_0_1, plain, ('Butler'!='AuntAgatha'), inference(start_rule)).
% 0.19/0.38 cnf(i_0_48, plain, ('Butler'!='AuntAgatha'), inference(extension_rule, [i_0_6])).
% 0.19/0.38 cnf(i_0_125, plain, (predicate2(esk5_1('AuntAgatha'),hate,'AuntAgatha','AuntAgatha')), inference(extension_rule, [i_0_8])).
% 0.19/0.38 cnf(i_0_126, plain, (~predicate2(X4,hate,'Charles','AuntAgatha')), inference(etableau_closure_rule, [i_0_126, ...])).
% 0.19/0.38 # End printing tableau
% 0.19/0.38 # SZS output end
% 0.19/0.38 # Branches closed with saturation will be marked with an "s"
% 0.19/0.38 # There were 1 total branch saturation attempts.
% 0.19/0.38 # There were 0 of these attempts blocked.
% 0.19/0.38 # There were 0 deferred branch saturation attempts.
% 0.19/0.38 # There were 0 free duplicated saturations.
% 0.19/0.38 # There were 1 total successful branch saturations.
% 0.19/0.38 # There were 0 successful branch saturations in interreduction.
% 0.19/0.38 # There were 0 successful branch saturations on the branch.
% 0.19/0.38 # There were 1 successful branch saturations after the branch.
% 0.19/0.38 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.38 # Begin clausification derivation
% 0.19/0.38
% 0.19/0.38 # End clausification derivation
% 0.19/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.38 cnf(i_0_12, plain, (predicate2(esk3_0,kill,esk1_0,'AuntAgatha'))).
% 0.19/0.38 cnf(i_0_14, plain, (predicate1(esk2_0,live,esk1_0))).
% 0.19/0.38 cnf(i_0_13, plain, (modifier_pp(esk2_0,in,'DreadburyMansion'))).
% 0.19/0.38 cnf(i_0_1, plain, ('Butler'!='AuntAgatha')).
% 0.19/0.38 cnf(i_0_15, negated_conjecture, (~predicate2(X1,kill,'AuntAgatha','AuntAgatha'))).
% 0.19/0.38 cnf(i_0_7, plain, (~predicate2(X1,hate,'AuntAgatha','Butler'))).
% 0.19/0.38 cnf(i_0_2, plain, (~predicate2(X1,hate,X2,esk9_1(X2)))).
% 0.19/0.38 cnf(i_0_8, plain, (~predicate2(X1,hate,'Charles',X2)|~predicate2(X3,hate,'AuntAgatha',X2))).
% 0.19/0.38 cnf(i_0_9, plain, (~property2(X1,rich,comp_than,X2)|~predicate2(X3,kill,X1,X2))).
% 0.19/0.38 cnf(i_0_6, plain, (X1='Butler'|predicate2(esk5_1(X1),hate,'AuntAgatha',X1))).
% 0.19/0.38 cnf(i_0_4, plain, (esk6_1(X1)=X1|predicate2(esk7_1(X1),hate,'Butler',X1))).
% 0.19/0.38 cnf(i_0_3, plain, (predicate2(esk8_2(X1,X2),hate,'Butler',X1)|~predicate2(X2,hate,'AuntAgatha',X1))).
% 0.19/0.38 cnf(i_0_10, plain, (predicate2(esk4_3(X1,X2,X3),hate,X1,X2)|~predicate2(X3,kill,X1,X2))).
% 0.19/0.38 cnf(i_0_11, plain, (X1='Charles'|X1='Butler'|X1='AuntAgatha'|~modifier_pp(X2,in,'DreadburyMansion')|~predicate1(X2,live,X1))).
% 0.19/0.38 cnf(i_0_5, plain, (property2(esk6_1(X1),rich,comp_than,'AuntAgatha')|predicate2(esk7_1(X1),hate,'Butler',X1))).
% 0.19/0.38 cnf(i_0_37, plain, (X58=X58)).
% 0.19/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.38 # Begin printing tableau
% 0.19/0.38 # Found 5 steps
% 0.19/0.38 cnf(i_0_7, plain, (~predicate2(esk5_1('Butler'),hate,'AuntAgatha','Butler')), inference(start_rule)).
% 0.19/0.38 cnf(i_0_50, plain, (~predicate2(esk5_1('Butler'),hate,'AuntAgatha','Butler')), inference(extension_rule, [i_0_6])).
% 0.19/0.38 cnf(i_0_124, plain, ('Butler'='Butler'), inference(extension_rule, [i_0_40])).
% 0.19/0.38 cnf(i_0_147, plain, ('Butler'='AuntAgatha'), inference(closure_rule, [i_0_1])).
% 0.19/0.38 cnf(i_0_149, plain, ('Butler'!='AuntAgatha'), inference(etableau_closure_rule, [i_0_149, ...])).
% 0.19/0.38 # End printing tableau
% 0.19/0.38 # SZS output end
% 0.19/0.38 # Branches closed with saturation will be marked with an "s"
% 0.19/0.38 # Child (19455) has found a proof.
% 0.19/0.38
% 0.19/0.38 # Proof search is over...
% 0.19/0.38 # Freeing feature tree
%------------------------------------------------------------------------------