TSTP Solution File: SYN101-1.002.002 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN101-1.002.002 : TPTP v8.1.0. Bugfixed v1.2.1.
% 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 : n027.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:08:10 EDT 2022
% Result : Unsatisfiable 0.11s 0.34s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SYN101-1.002.002 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.06/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.11/0.32 % Computer : n027.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Tue Jul 12 05:58:04 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.11/0.34 # No SInE strategy applied
% 0.11/0.34 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.11/0.34 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.11/0.34 #
% 0.11/0.34 # Presaturation interreduction done
% 0.11/0.34 # Number of axioms: 17 Number of unprocessed: 17
% 0.11/0.34 # Tableaux proof search.
% 0.11/0.34 # APR header successfully linked.
% 0.11/0.34 # Hello from C++
% 0.11/0.34 # The folding up rule is enabled...
% 0.11/0.34 # Local unification is enabled...
% 0.11/0.34 # Any saturation attempts will use folding labels...
% 0.11/0.34 # 17 beginning clauses after preprocessing and clausification
% 0.11/0.34 # Creating start rules for all 1 conjectures.
% 0.11/0.34 # There are 1 start rule candidates:
% 0.11/0.34 # Found 5 unit axioms.
% 0.11/0.34 # 1 start rule tableaux created.
% 0.11/0.34 # 12 extension rule candidate clauses
% 0.11/0.34 # 5 unit axiom clauses
% 0.11/0.34
% 0.11/0.34 # Requested 8, 32 cores available to the main process.
% 0.11/0.34 # There are not enough tableaux to fork, creating more from the initial 1
% 0.11/0.34 # There were 2 total branch saturation attempts.
% 0.11/0.34 # There were 0 of these attempts blocked.
% 0.11/0.34 # There were 0 deferred branch saturation attempts.
% 0.11/0.34 # There were 0 free duplicated saturations.
% 0.11/0.34 # There were 2 total successful branch saturations.
% 0.11/0.34 # There were 0 successful branch saturations in interreduction.
% 0.11/0.34 # There were 0 successful branch saturations on the branch.
% 0.11/0.34 # There were 2 successful branch saturations after the branch.
% 0.11/0.34 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.34 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.34 # Begin clausification derivation
% 0.11/0.34
% 0.11/0.34 # End clausification derivation
% 0.11/0.34 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.11/0.34 cnf(i_0_31, plain, (nq_1(a))).
% 0.11/0.34 cnf(i_0_33, plain, (nq_2(a))).
% 0.11/0.34 cnf(i_0_32, plain, (nq_1(b))).
% 0.11/0.34 cnf(i_0_34, plain, (nq_2(b))).
% 0.11/0.34 cnf(i_0_18, negated_conjecture, (~p_1_2(a,a))).
% 0.11/0.34 cnf(i_0_29, plain, (p_2_2(X1,X2)|~nq_2(X2)|~nq_1(X1))).
% 0.11/0.34 cnf(i_0_25, plain, (p_2_2(X1,X2)|~p_1_2(X1,X2))).
% 0.11/0.34 cnf(i_0_26, plain, (q_2_2(X1,X2)|~q_1_2(X1,X2))).
% 0.11/0.34 cnf(i_0_23, plain, (p_1_1(X1,X2)|~p_1_2(X1,X2))).
% 0.11/0.34 cnf(i_0_24, plain, (q_1_1(X1,X2)|~q_1_2(X1,X2))).
% 0.11/0.34 cnf(i_0_27, plain, (p_1_1(X1,X2)|~nq_2(X2)|~nq_1(X1))).
% 0.11/0.34 cnf(i_0_30, plain, (q_2_2(X1,X2)|~nq_2(X2)|~nq_1(X1))).
% 0.11/0.34 cnf(i_0_19, plain, (p_1_2(X1,X2)|~p_1_1(X1,X2)|~p_2_2(X1,X2))).
% 0.11/0.34 cnf(i_0_20, plain, (p_1_2(X1,X2)|~q_1_1(X1,X2)|~q_2_2(X1,X2))).
% 0.11/0.34 cnf(i_0_28, plain, (q_1_1(X1,X2)|~nq_2(X2)|~nq_1(X1))).
% 0.11/0.34 cnf(i_0_21, plain, (q_1_2(X1,X2)|~q_1_1(X1,X2)|~p_2_2(X1,X2))).
% 0.11/0.34 cnf(i_0_22, plain, (q_1_2(X1,X2)|~q_2_2(X1,X2)|~p_1_1(X1,X2))).
% 0.11/0.34 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.11/0.34 # Begin printing tableau
% 0.11/0.34 # Found 5 steps
% 0.11/0.34 cnf(i_0_18, negated_conjecture, (~p_1_2(a,a)), inference(start_rule)).
% 0.11/0.34 cnf(i_0_35, plain, (~p_1_2(a,a)), inference(extension_rule, [i_0_20])).
% 0.11/0.34 cnf(i_0_57, plain, (~q_1_1(a,a)), inference(extension_rule, [i_0_24])).
% 0.11/0.34 cnf(i_0_58, plain, (~q_2_2(a,a)), inference(etableau_closure_rule, [i_0_58, ...])).
% 0.11/0.34 cnf(i_0_78, plain, (~q_1_2(a,a)), inference(etableau_closure_rule, [i_0_78, ...])).
% 0.11/0.34 # End printing tableau
% 0.11/0.34 # SZS output end
% 0.11/0.34 # Branches closed with saturation will be marked with an "s"
% 0.11/0.34 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux.
% 0.11/0.34 # We now have 2 tableaux to operate on
% 0.11/0.34 # Found closed tableau during pool population.
% 0.11/0.34 # Proof search is over...
% 0.11/0.34 # Freeing feature tree
%------------------------------------------------------------------------------