TSTP Solution File: ANA133-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : ANA133-1 : TPTP v8.1.0. Released v8.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 : n014.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 14 18:55:30 EDT 2022
% Result : Unsatisfiable 11.69s 1.89s
% Output : CNFRefutation 11.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : ANA133-1 : TPTP v8.1.0. Released v8.1.0.
% 0.11/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.33 % Computer : n014.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Fri Jul 8 03:06:06 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.36 # No SInE strategy applied
% 0.13/0.36 # Auto-Mode selected heuristic C12_02_nc_SAT001_MinMin_rr
% 0.13/0.36 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.13/0.36 #
% 0.13/0.36 # Presaturation interreduction done
% 0.13/0.36 # Number of axioms: 17 Number of unprocessed: 17
% 0.13/0.36 # Tableaux proof search.
% 0.13/0.36 # APR header successfully linked.
% 0.13/0.36 # Hello from C++
% 0.13/0.36 # The folding up rule is enabled...
% 0.13/0.36 # Local unification is enabled...
% 0.13/0.36 # Any saturation attempts will use folding labels...
% 0.13/0.36 # 17 beginning clauses after preprocessing and clausification
% 0.13/0.36 # Creating start rules for all 1 conjectures.
% 0.13/0.36 # There are 1 start rule candidates:
% 0.13/0.36 # Found 17 unit axioms.
% 0.13/0.36 # 1 start rule tableaux created.
% 0.13/0.36 # 0 extension rule candidate clauses
% 0.13/0.36 # 17 unit axiom clauses
% 0.13/0.36
% 0.13/0.36 # Requested 8, 32 cores available to the main process.
% 0.13/0.36 # There are not enough tableaux to fork, creating more from the initial 1
% 0.13/0.36 # Creating equality axioms
% 0.13/0.36 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.36 # Returning from population with 27 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.36 # We now have 27 tableaux to operate on
% 11.69/1.89 # There were 1 total branch saturation attempts.
% 11.69/1.89 # There were 0 of these attempts blocked.
% 11.69/1.89 # There were 0 deferred branch saturation attempts.
% 11.69/1.89 # There were 0 free duplicated saturations.
% 11.69/1.89 # There were 1 total successful branch saturations.
% 11.69/1.89 # There were 0 successful branch saturations in interreduction.
% 11.69/1.89 # There were 0 successful branch saturations on the branch.
% 11.69/1.89 # There were 1 successful branch saturations after the branch.
% 11.69/1.89 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.69/1.89 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.69/1.89 # Begin clausification derivation
% 11.69/1.89
% 11.69/1.89 # End clausification derivation
% 11.69/1.89 # Begin listing active clauses obtained from FOF to CNF conversion
% 11.69/1.89 cnf(i_0_29, plain, (d(x)=one)).
% 11.69/1.89 cnf(i_0_27, plain, (d(zero)=zero)).
% 11.69/1.89 cnf(i_0_28, plain, (d(one)=zero)).
% 11.69/1.89 cnf(i_0_23, plain, (times(zero,X1)=zero)).
% 11.69/1.89 cnf(i_0_22, plain, ('+'(zero,X1)=X1)).
% 11.69/1.89 cnf(i_0_24, plain, (times(one,X1)=X1)).
% 11.69/1.89 cnf(i_0_26, plain, ('+'(X1,minus(X1))=zero)).
% 11.69/1.89 cnf(i_0_30, plain, (d('+'(X1,X2))='+'(d(X1),d(X2)))).
% 11.69/1.89 cnf(i_0_32, plain, (times(d(X1),cos(X1))=d(sin(X1)))).
% 11.69/1.89 cnf(i_0_33, plain, (minus(times(d(X1),sin(X1)))=d(cos(X1)))).
% 11.69/1.89 cnf(i_0_21, plain, (times(times(X1,X2),X3)=times(X1,times(X2,X3)))).
% 11.69/1.89 cnf(i_0_31, plain, ('+'(times(X1,d(X2)),times(X2,d(X1)))=d(times(X1,X2)))).
% 11.69/1.89 cnf(i_0_25, plain, ('+'(times(X1,X2),times(X1,X3))=times(X1,'+'(X2,X3)))).
% 11.69/1.89 cnf(i_0_19, plain, ('+'('+'(X1,X2),X3)='+'(X1,'+'(X2,X3)))).
% 11.69/1.89 cnf(i_0_18, plain, ('+'(X1,X2)='+'(X2,X1))).
% 11.69/1.89 cnf(i_0_20, plain, (times(X1,X2)=times(X2,X1))).
% 11.69/1.89 cnf(i_0_34, negated_conjecture, (d(X1)!=times(x,cos(x)))).
% 11.69/1.89 cnf(i_0_36, plain, (X4=X4)).
% 11.69/1.89 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 11.69/1.89 # Begin printing tableau
% 11.69/1.89 # Found 6 steps
% 11.69/1.89 cnf(i_0_29, plain, (d(x)=one), inference(start_rule)).
% 11.69/1.89 cnf(i_0_46, plain, (d(x)=one), inference(extension_rule, [i_0_40])).
% 11.69/1.89 cnf(i_0_73, plain, (d(x)!=one), inference(closure_rule, [i_0_29])).
% 11.69/1.89 cnf(i_0_71, plain, ('+'(d(x),d(x))='+'(one,one)), inference(extension_rule, [i_0_39])).
% 11.69/1.89 cnf(i_0_91, plain, ('+'(one,one)!='+'(zero,'+'(one,one))), inference(closure_rule, [i_0_22])).
% 11.69/1.89 cnf(i_0_89, plain, ('+'(d(x),d(x))='+'(zero,'+'(one,one))), inference(etableau_closure_rule, [i_0_89, ...])).
% 11.69/1.89 # End printing tableau
% 11.69/1.89 # SZS output end
% 11.69/1.89 # Branches closed with saturation will be marked with an "s"
% 11.69/1.90 # Child (18921) has found a proof.
% 11.69/1.90
% 11.69/1.90 # Proof search is over...
% 11.69/1.90 # Freeing feature tree
%------------------------------------------------------------------------------