TSTP Solution File: SYN966+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN966+1 : TPTP v8.1.0. Released v3.1.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 : n025.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 : Thu Jul 21 06:15:08 EDT 2022
% Result : Theorem 0.14s 0.38s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SYN966+1 : TPTP v8.1.0. Released v3.1.0.
% 0.08/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.14/0.34 % Computer : n025.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jul 11 19:52:02 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.37 # No SInE strategy applied
% 0.14/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.14/0.37 #
% 0.14/0.37 # Presaturation interreduction done
% 0.14/0.37 # Number of axioms: 6 Number of unprocessed: 6
% 0.14/0.37 # Tableaux proof search.
% 0.14/0.37 # APR header successfully linked.
% 0.14/0.37 # Hello from C++
% 0.14/0.38 # The folding up rule is enabled...
% 0.14/0.38 # Local unification is enabled...
% 0.14/0.38 # Any saturation attempts will use folding labels...
% 0.14/0.38 # 6 beginning clauses after preprocessing and clausification
% 0.14/0.38 # Creating start rules for all 6 conjectures.
% 0.14/0.38 # There are 6 start rule candidates:
% 0.14/0.38 # Found 2 unit axioms.
% 0.14/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.14/0.38 # 6 start rule tableaux created.
% 0.14/0.38 # 4 extension rule candidate clauses
% 0.14/0.38 # 2 unit axiom clauses
% 0.14/0.38
% 0.14/0.38 # Requested 8, 32 cores available to the main process.
% 0.14/0.38 # There are not enough tableaux to fork, creating more from the initial 6
% 0.14/0.38 # Returning from population with 12 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.38 # We now have 12 tableaux to operate on
% 0.14/0.38 # There were 2 total branch saturation attempts.
% 0.14/0.38 # There were 0 of these attempts blocked.
% 0.14/0.38 # There were 0 deferred branch saturation attempts.
% 0.14/0.38 # There were 1 free duplicated saturations.
% 0.14/0.38 # There were 2 total successful branch saturations.
% 0.14/0.38 # There were 1 successful branch saturations in interreduction.
% 0.14/0.38 # There were 0 successful branch saturations on the branch.
% 0.14/0.38 # There were 0 successful branch saturations after the branch.
% 0.14/0.38 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38 # Begin clausification derivation
% 0.14/0.38
% 0.14/0.38 # End clausification derivation
% 0.14/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.14/0.38 cnf(i_0_2, negated_conjecture, (eq(esk2_0,esk3_0))).
% 0.14/0.38 cnf(i_0_1, negated_conjecture, (~eq(esk3_0,esk2_0))).
% 0.14/0.38 cnf(i_0_5, negated_conjecture, (a_member_of(X1,X2)|~a_member_of(X1,X3)|~eq(X2,X3))).
% 0.14/0.38 cnf(i_0_6, negated_conjecture, (a_member_of(X1,X2)|~a_member_of(X1,X3)|~eq(X3,X2))).
% 0.14/0.38 cnf(i_0_4, negated_conjecture, (eq(X1,X2)|~a_member_of(esk1_2(X1,X2),X2)|~a_member_of(esk1_2(X1,X2),X1))).
% 0.14/0.38 cnf(i_0_3, negated_conjecture, (a_member_of(esk1_2(X1,X2),X1)|a_member_of(esk1_2(X1,X2),X2)|eq(X1,X2))).
% 0.14/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.14/0.38 # Begin printing tableau
% 0.14/0.38 # Found 14 steps
% 0.14/0.38 cnf(i_0_5, negated_conjecture, (a_member_of(esk1_2(esk3_0,esk2_0),esk2_0)|~a_member_of(esk1_2(esk3_0,esk2_0),esk3_0)|~eq(esk2_0,esk3_0)), inference(start_rule)).
% 0.14/0.38 cnf(i_0_18, plain, (~eq(esk2_0,esk3_0)), inference(closure_rule, [i_0_2])).
% 0.14/0.38 cnf(i_0_16, plain, (a_member_of(esk1_2(esk3_0,esk2_0),esk2_0)), inference(extension_rule, [i_0_4])).
% 0.14/0.38 cnf(i_0_72, plain, (eq(esk3_0,esk2_0)), inference(closure_rule, [i_0_1])).
% 0.14/0.38 cnf(i_0_74, plain, (~a_member_of(esk1_2(esk3_0,esk2_0),esk3_0)), inference(extension_rule, [i_0_6])).
% 0.14/0.38 cnf(i_0_79, plain, (~a_member_of(esk1_2(esk3_0,esk2_0),esk2_0)), inference(closure_rule, [i_0_16])).
% 0.14/0.38 cnf(i_0_80, plain, (~eq(esk2_0,esk3_0)), inference(closure_rule, [i_0_2])).
% 0.14/0.38 cnf(i_0_17, plain, (~a_member_of(esk1_2(esk3_0,esk2_0),esk3_0)), inference(extension_rule, [i_0_5])).
% 0.14/0.38 cnf(i_0_85, plain, (~a_member_of(esk1_2(esk3_0,esk2_0),esk3_0)), inference(extension_rule, [i_0_3])).
% 0.14/0.38 cnf(i_0_88, plain, (a_member_of(esk1_2(esk3_0,esk2_0),esk2_0)), inference(closure_rule, [i_0_16])).
% 0.14/0.38 cnf(i_0_89, plain, (eq(esk3_0,esk2_0)), inference(closure_rule, [i_0_1])).
% 0.14/0.38 cnf(i_0_86, plain, (~eq(esk3_0,esk3_0)), inference(extension_rule, [i_0_4])).
% 0.14/0.38 cnf(i_0_91, plain, (~a_member_of(esk1_2(esk3_0,esk3_0),esk3_0)), inference(etableau_closure_rule, [i_0_91, ...])).
% 0.14/0.38 cnf(i_0_92, plain, (~a_member_of(esk1_2(esk3_0,esk3_0),esk3_0)), inference(etableau_closure_rule, [i_0_92, ...])).
% 0.14/0.38 # End printing tableau
% 0.14/0.38 # SZS output end
% 0.14/0.38 # Branches closed with saturation will be marked with an "s"
% 0.14/0.38 # Child (12568) has found a proof.
% 0.14/0.38
% 0.14/0.38 # Proof search is over...
% 0.14/0.38 # Freeing feature tree
%------------------------------------------------------------------------------